Switch to: References

Add citations

You must login to add citations.
  1. Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
    Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • General iteration and unary functions.G. M. Germano & S. Mazzanti - 1991 - Annals of Pure and Applied Logic 54 (2):137-178.
    Programming practice suggests a notion of general iteration corresponding to the while-do construct. This leads to new characterizations of general computable unary functions usable in computer science.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • 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-6f97f49787-kd5kv uwo