Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   595 citations  
  • (1 other version)Inductive Inference and Computable One-One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):463-479.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Inductive Inference and Computable One‐One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Mathematical Logic Quarterly 28 (27‐32):463-479.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
    Download  
     
    Export citation  
     
    Bookmark   33 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-5cf77db6b5-2l4td uwo