On systems of definitions, induction and recursion
✍ Scribed by Lars Hallnäs
- Publisher
- Springer Netherlands
- Year
- 1992
- Tongue
- English
- Weight
- 895 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quantitative analogue of probabilistic bisimilarity in the sense that the distance zero captures the probabilistic bisimilarity. The model we are interested in is probabilistic automata, which are based on
We combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions