The complexity of universal text-learners.

DOI10.1006/INCO.1999.2804zbMath1045.68576OpenAlexW2022046192MaRDI QIDQ1854315

Sebastiaan A. Terwijn, Frank Stephan

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/53848b2c1239744dcd882b385e795227c2d7c393

zbMATH Keywords

Turing degrees

Mathematics Subject Classification ID

Computational learning theory (68Q32) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the non-existence of maximal inference degrees for language identification
• Teaching a smarter learner.
• Synthesizing inductive expertise
• On uniform learnability of language families
• Learning with the knowledge of an upper bound on program size
• On the power of inductive inference from good examples
• Classical recursion theory. Vol. II
• Extremes in the degrees of inferability
• Inductive inference of formal languages from positive data
• A universal inductive inference machine
• Inductive inference and unsolvability
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Classes of Recursively Enumerable Sets and Their Decision Problems

This page was built for publication: The complexity of universal text-learners.