Effectivity Questions for Kleene’s Recursion Theorem

  • John Case
  • Sanjay Jain
  • Frank Stephan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7734)


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.


inductive inference Kleene’s Recursion Theorem Kolmogorov complexity optimal numberings 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar74]
    Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs 1, 82–88 (1974)Google Scholar
  2. [Cas99]
    Case, J.: The power of vacillation in language learning. SIAM Journal on Computing 28, 1941–1969 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  3. [CJS02]
    Case, J., Jain, S., Suraj, M.: Control structures in hypothesis spaces: The influence on learning. Theoretical Computer Science 270(1-2), 287–308 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  4. [CM09]
    Case, J., Moelius III, S.E.: Program Self-reference in Constructive Scott Subdomains. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 89–98. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. [CS83]
    Case, J., Smith, C.H.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 193–220 (1983)MathSciNetzbMATHCrossRefGoogle Scholar
  6. [Gol67]
    Mark Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)zbMATHCrossRefGoogle Scholar
  7. [Jai11]
    Jain, S.: Hypothesis spaces for learning. Information and Computation 209(3), 513–527 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  8. [JS10]
    Jain, S., Stephan, F.: Numberings optimal for learning. Journal of Computer and System Sciences 76(3-4), 233–250 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  9. [Kle38]
    Kleene, S.C.: On notation for ordinal numbers. Journal of Symbolic Logic 3(4), 150–155 (1938)MathSciNetzbMATHCrossRefGoogle Scholar
  10. [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
  11. [Moe09]
    Moelius III, S.E.: Program Self-Reference. PhD thesis, University of Delaware (2009)Google Scholar
  12. [Nie09]
    Nies, A.: Computability and Randomness. Oxford Logic Guides. Oxford University Press (2009)Google Scholar
  13. [OW82]
    Osherson, D.N., Weinstein, S.: Criteria of language learning. Information and Control 52, 123–138 (1982)MathSciNetzbMATHCrossRefGoogle Scholar
  14. [Ric80]
    Riccardi, G.A.: The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo (1980)Google Scholar
  15. [Ric81]
    Riccardi, G.A.: The independence of control structures in abstract programming systems. Journal of Computer and System Sciences 22(2), 107–143 (1981)MathSciNetzbMATHCrossRefGoogle Scholar
  16. [Rog67]
    Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw Hill (1967); Reprinted. MIT Press (1987)Google Scholar
  17. [Roy87]
    Royer, J.S.: A Connotational Theory of Program Structure. LNCS, vol. 273. Springer, Heidelberg (1987)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • John Case
    • 1
  • Sanjay Jain
    • 2
  • Frank Stephan
    • 3
  1. 1.Department of Computer and Information SciencesUniversity of DelawareNewarkUSA
  2. 2.Department of Computer ScienceNational University of SingaporeSingapore
  3. 3.Department of Mathematics and Department of Computer ScienceNational University of SingaporeSingapore

Personalised recommendations