Order:
  1. (1 other version)Computing machinery and intelligence.Alan Turing - 1950 - Mind 59 (236):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 (20 more)  
     
    Export citation  
     
    Bookmark   1085 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.  65
    Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
  4. Intelligent machinery, a heretical theory.A. M. Turing - 1996 - Philosophia Mathematica 4 (3):256-260.
  5. 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  
     
    Bookmark   35 citations  
  6. (1 other version)Computability and λ-definability.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):153-163.
  7.  67
    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  
     
    Bookmark   6 citations  
  8.  60
    (1 other version)Practical forms of type theory.A. M. Turing - 1948 - Journal of Symbolic Logic 13 (2):80-94.
  9.  24
    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. New York: Elsevier. pp. 153.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  52
    (1 other version)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.
  11.  19
    Alan Turing's systems of logic: the Princeton thesis.Alan Turing - 2012 - Woodstock, England: Princeton University Press. Edited by Andrew W. Appel & Solomon Feferman.
    Though less well known than his other work, Turings 1938 Princeton Thesis, this title which includes his notion of an oracle machine, has had a lasting influence on computer science and mathematics. It presents a facsimile of the original typescript of the thesis along with essays by Appel and Feferman that explain its still-unfolding significance.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  42
    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-179.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  6
    Mathematical logic.Alan Mathison Turing - 2001 - New York: Elsevier Science. Edited by R. O. Gandy & C. E. M. Yates.
  14.  59
    The p-function in λ-k-conversion.A. M. Turing - 1937 - Journal of Symbolic Logic 2 (4):164.
  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  
     
    Bookmark  
  16.  69
    The use of dots as brackets in church's system.A. M. Turing - 1942 - Journal of Symbolic Logic 7 (4):146-156.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark