From Inductive Inference to Algorithmic Learning Theory
Abstract
We present two phenomena which were discovered in pure recursion-theoretic inductive inference, namely inconsistent learning (learning strategies producing apparently “senseless” hypotheses can solve problems unsolvable by “reasonable” learning strategies) and learning from good examples (“much less” information can lead to much more learning power). Recently, it has been shown that these phenomena also hold in the world of polynomial-time algorithmic learning. Thus inductive inference can be understood and used as a source of potent ideas guiding both research and applications in algorithmic learning theory.
Cite
Text
Wiehagen. "From Inductive Inference to Algorithmic Learning Theory." International Conference on Algorithmic Learning Theory, 1992. doi:10.1007/3-540-57369-0_24Markdown
[Wiehagen. "From Inductive Inference to Algorithmic Learning Theory." International Conference on Algorithmic Learning Theory, 1992.](https://mlanthology.org/alt/1992/wiehagen1992alt-inductive/) doi:10.1007/3-540-57369-0_24BibTeX
@inproceedings{wiehagen1992alt-inductive,
title = {{From Inductive Inference to Algorithmic Learning Theory}},
author = {Wiehagen, Rolf},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1992},
pages = {13-24},
doi = {10.1007/3-540-57369-0_24},
url = {https://mlanthology.org/alt/1992/wiehagen1992alt-inductive/}
}