Probabilistic Inductive Inference:a Survey
Machine Learning
2007-05-23 v1 Computational Complexity
Logic in Computer Science
Logic
Abstract
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.
Keywords
Cite
@article{arxiv.cs/9902026,
title = {Probabilistic Inductive Inference:a Survey},
author = {Andris Ambainis},
journal= {arXiv preprint arXiv:cs/9902026},
year = {2007}
}
Comments
16 pages, to appear in Theoretical Computer Science