Effectivity Questions for Kleene’s Recursion Theorem
The present paper explores the interaction between two recursion-theoretic notions: program self-reference and learning partial recursive functions in the limit. Kleene’s Recursion Theorem formalises the notion of program self-reference: It says that given a partial-recursive function ψ p there is an index e such that the e-th function ψ e is equal to the e-th slice of ψ p . The paper studies constructive forms of Kleene’s recursion theorem which are inspired by learning criteria from inductive inference and also relates these constructive forms to notions of learnability. For example, it is shown that a numbering can fail to satisfy Kleene’s Recursion Theorem, yet that numbering can still be used as a hypothesis space when learning explanatorily an arbitrary learnable class. The paper provides a detailed picture of numberings separating various versions of Kleene’s Recursion Theorem and learnability.
Keywordsinductive inference Kleene’s Recursion Theorem Kolmogorov complexity optimal numberings
Unable to display preview. Download preview PDF.
- [Bar74]Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs 1, 82–88 (1974)Google Scholar
- [LV08]Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Texts in Computer Science. Springer (2008)Google Scholar
- [Moe09]Moelius III, S.E.: Program Self-Reference. PhD thesis, University of Delaware (2009)Google Scholar
- [Nie09]Nies, A.: Computability and Randomness. Oxford Logic Guides. Oxford University Press (2009)Google Scholar
- [Ric80]Riccardi, G.A.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)Google Scholar
- [Rog67]Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw Hill (1967); Reprinted. MIT Press (1987)Google Scholar