Switch to: Citations

Add references

You must login to add references.
  1. The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Rekursionszahlen und die Grzegorczyk-Hierarchie.Helmut Schwichtenberg - 1969 - Archive for Mathematical Logic 12 (1-2):85-97.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6d5f778f9-t6hwg uwo