Kolmogorov numberings and minimal identification

DOI10.1016/S0304-3975(96)00295-2zbMath0893.68082MaRDI QIDQ1389656

Sanjay Jain, Rūsiņš Freivalds

Publication date: 30 June 1998

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

zbMATH Keywords

Kolmogorov numberings

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (1)

Learning languages and functions by erasing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Inductive inference of recursive functions: Qualitative theory
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Kolmogorov numberings and minimal identification