On the non-existence of maximal inference degrees for language identification

DOI10.1016/0020-0190(93)90229-3zbMath0777.03013OpenAlexW1985133821WikidataQ127088229 ScholiaQ127088229MaRDI QIDQ685478

Sanjay Jain, Arun Sharma

Publication date: 15 December 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90229-3

zbMATH Keywords

oracledegrees of inferabilityinductive inference machine

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Other degrees and reducibilities in computability and recursion theory (03D30) Turing machines and related notions (03D10)

Related Items (8)

Learning power and language expressiveness. ⋮ The complexity of universal text-learners ⋮ Results on memory-limited U-shaped learning ⋮ On the learnability of vector spaces ⋮ Learning by switching type of information. ⋮ Input-dependence in function-learning ⋮ The complexity of universal text-learners. ⋮ Extremes in the degrees of inferability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of degrees of inferability.
• Gödel numberings of partial recursive functions
• Inductive inference and unsolvability
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Criteria of language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: On the non-existence of maximal inference degrees for language identification