Effectivity Questions for Kleene’s Recursion Theorem

DOI10.1007/978-3-642-35722-0_7zbMath1419.68058OpenAlexW88947388MaRDI QIDQ3455838

Sanjay Jain, Frank Stephan, John Case

Publication date: 11 December 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_7

zbMATH Keywords

Kolmogorov complexityinductive inferenceKleene's recursion theoremoptimal numberings

Mathematics Subject Classification ID

Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

Effectivity questions for Kleene's recursion theorem

Cites Work

• Hypothesis spaces for learning
• A connotational theory of program structure
• Comparison of identification criteria for machine inductive inference
• Numberings optimal for learning
• The independence of control structures in abstract programming systems
• Program Self-reference in Constructive Scott Subdomains
• The Power of Vacillation in Language Learning
• Criteria of language learning
• Language identification in the limit
• On notation for ordinal numbers
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: Effectivity Questions for Kleene’s Recursion Theorem