Probabilistic Inductive Inference:a Survey
| dc.creator | Ambainis, Andris | |
| dc.date | 1999-02-15 | |
| dc.date.accessioned | 2026-07-07T03:23:59Z | |
| dc.date.available | 2026-07-07T03:23:59Z | |
| dc.description | Inductive inference is a recursion-theoretic theory of learning, first developed by E. M. Gold (1967). This paper surveys developments in probabilistic inductive inference. We mainly focus on finite inference of recursive functions, since this simple paradigm has produced the most interesting (and most complex) results. | |
| dc.description | 16 pages, to appear in Theoretical Computer Science | |
| dc.identifier | https://arxiv.org/abs/cs/9902026 | |
| dc.identifier | http://arxiv.org/abs/cs/9902026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33157 | |
| dc.subject | Machine Learning | |
| dc.subject | Computational Complexity | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Logic | |
| dc.subject | F.1.1., F.4.1., I.2.3., I.2.6 | |
| dc.title | Probabilistic Inductive Inference:a Survey | |
| dc.type | text |