Learning how to separate.

DOI10.1016/J.TCS.2003.11.006zbMath1069.68057OpenAlexW2151078629MaRDI QIDQ1426149

Frank Stephan, Sanjay Jain

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.006

zbMATH Keywords

total recursive functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Prudence and other conditions on formal language learning
• On the structure of degrees of inferability.
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Some natural properties of strong-identification in inductive inference
• Classical recursion theory. Vol. II
• Toward a mathematical theory of inductive inference
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Language identification in the limit

This page was built for publication: Learning how to separate.