Switch to: Citations

References in:

Computing machinery and intelligence

Mind 59 (236):433-60 (1950)

Add references

You must login to add references.
  1. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
    Download  
     
    Export citation  
     
    Bookmark   723 citations  
  • An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
    Download  
     
    Export citation  
     
    Bookmark   177 citations  
  • S. C. Kleene. General recursive functions of natural numbers. Mathematische Annalen, Bd. 112 (1935–1936), S. 727–742.S. C. Kleene - 1937 - Journal of Symbolic Logic 2 (1):38-38.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
    Download  
     
    Export citation  
     
    Bookmark   253 citations  
  • Turing A. M.. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 , pp. 230–265. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):42-43.
    Download  
     
    Export citation  
     
    Bookmark   72 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-7f8ff5d46-lkplx uwo