AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS

DOI10.1142/S012905419500007XMaRDI QIDQ4852317zbMATH OpenOpenAlexFDO

Authors Sanjay Jain

Publication date 3 December 1995

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012905419500007x

zbMATH Keywords

Kolmogorov numberinglearning theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Kolmogorov numberings and minimal identification
• On a question about learning nearly minimal programs
• scientific article; zbMATH DE number 2077151
• Inductive inference of recursive functions: qualitative theory
• Identifying nearly minimal Gödel numbers from additional information

Cited in

(8)

• Identifying nearly minimal Gödel numbers from additional information
• Kolmogorov numberings and minimal identification
• Learning languages and functions by erasing
• Short lists with short programs from programs of functions and strings
• On a question of nearly minimal identification of functions
• On learning and co-learning of minimal programs
• scientific article; zbMATH DE number 2077151 (Why is no real title available?)
• On a question about learning nearly minimal programs

This page was built for publication: AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852317)