Order:
Disambiguations
A. M. Turing [18]Alan M. Turing [3]Alan Mathison Turing [3]Alan Turing [1]
Am Turing [1]
  1. Computing Machinery and Intelligence.Alan M. Turing - 1950 - 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 (18 more)  
     
    Export citation  
     
    My bibliography   297 citations  
  2. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
  3.  43
    Can Automatic Calculating Machines Be Said to Think?M. H. A. Newman, Alan M. Turing, Geoffrey Jefferson, R. B. Braithwaite & S. Shieber - 2004 - 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.  13
    Systems of Logic Based on Ordinals.Alan Mathison Turing - 1939 - London: Printed by C.F. Hodgson & Son.
    Direct download  
     
    Export citation  
     
    My bibliography   24 citations  
  5.  44
    Entscheidungsproblem.A. M. Turing - unknown
    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  
  6. Intelligent Machinery, a Heretical Theory.A. M. Turing - 1996 - Philosophia Mathematica 4 (3):256-260.
  7. Computability and Λ-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
  8.  13
    On Computable Numbers, with an Application to the Entscheidungsproblem.Alonzo Church & A. M. Turing - 1937 - Journal of Symbolic Logic 2 (1):42.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  9.  27
    Computability and $Lambda$-Definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
  10.  39
    The Use of Dots as Brackets in Church's System.A. M. Turing - 1942 - Journal of Symbolic Logic 7 (4):146-156.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  11.  16
    Practical Forms of Type Theory.A. M. Turing - 1948 - Journal of Symbolic Logic 13 (2):80-94.
  12.  19
    A Formal Theorem in Church's Theory of Types.M. H. A. Newman & A. M. Turing - 1942 - Journal of Symbolic Logic 7 (1):28-33.
  13.  23
    The P-Function in Λ-K-Conversion.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):164.
  14.  3
    A Formal Theorem in Church's Theory of Types.M. H. A. Newman & A. M. Turing - 1942 - Journal of Symbolic Logic 7 (3):122-122.
    Direct download  
     
    Export citation  
     
    My bibliography  
  15. 1. The Imitation Game.Alan M. Turing - 2006 - In Maureen Eckert (ed.), Theories of Mind: An Introductory Reader. Rowman & Littlefield. pp. 51.
     
    Export citation  
     
    My bibliography  
  16.  2
    Burks Arthur W.. The Logic of Programming Electronic Digital Computers. Industrial Mathematics , Vol. 1 , Pp. 36–52.A. M. Turing - 1953 - Journal of Symbolic Logic 18 (2):179.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17.  2
    Lv Welch.Sg Simpson, Ta Slaman, Steel Jr, Wh Woodin, Ri Soare, M. Stob, C. Spector & Am Turing - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 153.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  18.  1
    The $Mathfrak{P}$-Function in $Lambda-K$-Conversion.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):164-164.
  19. Alan Turing's Systems of Logic: The Princeton Thesis.Alan Mathison Turing - 2012 - Princeton University Press.
     
    Export citation  
     
    My bibliography  
  20. Review: Arthur W. Burks, The Logic of Programming Electronic Digital Computers. [REVIEW]A. M. Turing - 1953 - Journal of Symbolic Logic 18 (2):179-179.
     
    Export citation  
     
    My bibliography