Recursion theoretic models of learning: Some results and intuitions
From MaRDI portal
Publication:1924732
DOI10.1007/BF01534453zbMath0855.68078OpenAlexW1968197408MaRDI QIDQ1924732
Carl H. Smith, William I. Gasarch
Publication date: 20 October 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01534453
Related Items (3)
Parsimony hierarchies for inductive inference ⋮ On the intrinsic complexity of learning recursive functions ⋮ Learning via finitely many queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Training sequences
- Prudence and other conditions on formal language learning
- Probability and plurality for aggregations of learning machines
- On the role of procrastination in machine learning
- Aggregating inductive expertise
- Probabilistic inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Learning via queries in [+, <]
- Toward a mathematical theory of inductive inference
- Learning via queries
- Language identification in the limit
- The constructive second number class
This page was built for publication: Recursion theoretic models of learning: Some results and intuitions
