17 found
Order:
  1. Alan M. Turing (1950). Computing Machinery and Intelligence. Mind 59 (October):433-60.
    I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to (...)
    Direct download (19 more)  
     
    Export citation  
     
    My bibliography   232 citations  
  2.  34
    Alan Turing (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1):230-265.
  3.  19
    M. H. A. Newman, Alan M. Turing, Geoffrey Jefferson, R. B. Braithwaite & S. Shieber (2004). Can Automatic Calculating Machines Be Said to Think? In Stuart M. Shieber (ed.), The Turing Test: Verbal Behavior as the Hallmark of Intelligence. MIT Press
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   7 citations  
  4.  41
    A. M. Turing, Entscheidungsproblem.
    There are many complex characters in this paper; if you find them difficult to distinguish, you are advised to increase the viewing size.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  5.  6
    Alan Mathison Turing (1939). Systems of Logic Based on Ordinals. London, Printed by C.F. Hodgson & Son, Ltd..
    Direct download  
     
    Export citation  
     
    My bibliography   23 citations  
  6.  97
    A. M. Turing (1996). Intelligent Machinery, a Heretical Theory. Philosophia Mathematica 4 (3):256-260.
  7. A. M. Turing (1937). Computability and Λ-Definability. Journal of Symbolic Logic 2 (4):153-163.
  8.  35
    A. M. Turing (1942). The Use of Dots as Brackets in Church's System. Journal of Symbolic Logic 7 (4):146-156.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  9.  8
    A. M. Turing (1937). Computability and $Lambda$-Definability. Journal of Symbolic Logic 2 (4):153-163.
    Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  10.  15
    A. M. Turing (1948). Practical Forms of Type Theory. Journal of Symbolic Logic 13 (2):80-94.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  21
    A. M. Turing (1937). The P-Function in Λ-K-Conversion. Journal of Symbolic Logic 2 (4):164.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  12.  13
    M. H. A. Newman & A. M. Turing (1942). A Formal Theorem in Church's Theory of Types. Journal of Symbolic Logic 7 (1):28-33.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  13. Alan M. Turing (2006). 1. The Imitation Game. In Maureen Eckert (ed.), Theories of Mind: An Introductory Reader. Rowman and Littlefield 51.
     
    Export citation  
     
    My bibliography  
  14.  2
    Sg Simpson, Ta Slaman, Steel Jr, Wh Woodin, Ri Soare, M. Stob, C. Spector & Am Turing (1999). Lv Welch. In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier 153.
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  15.  1
    A. M. Turing (1937). The $Mathfrak{P}$-Function in $Lambda-K$-Conversion. Journal of Symbolic Logic 2 (4):164-164.
    Direct download  
     
    Export citation  
     
    My bibliography  
  16. Alan Mathison Turing (2012). Alan Turing's Systems of Logic: The Princeton Thesis. Princeton University Press.
     
    Export citation  
     
    My bibliography  
  17. A. M. Turing (1953). Review: Arthur W. Burks, The Logic of Programming Electronic Digital Computers. [REVIEW] Journal of Symbolic Logic 18 (2):179-179.
     
    Export citation  
     
    My bibliography