Prescribed Learning of R.E. Classes

DOI10.1007/978-3-540-75225-7_9zbMath1142.68395OpenAlexW2174302051MaRDI QIDQ3520050

Nan Ye, Sanjay Jain, Frank Stephan

Publication date: 19 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_9

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Hypothesis Spaces for Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and dual monotonic language learning
• Prudence and other conditions on formal language learning
• Classical recursion theory. The theory of functions and sets of natural numbers
• Separation of uniform learning classes.
• Increasing the power of uniform inductive learners
• Characterizations of monotonic and dual monotonic language learning
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Learning in Friedberg Numberings
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Prudence in vacillatory language identification
• Language identification in the limit
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: Prescribed Learning of R.E. Classes