Works by A. Turing ( view other items matching `Turing, A`, view all matches )

10 found
Sort by:
  1. 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. (In IExplorer, go to View menu, Text Size; in Netscape, go to View menu, Increase Font.).
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. A. M. Turing (1996). Intelligent Machinery, a Heretical Theory. Philosophia Mathematica 4 (3):256-260.
  3. 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 (20 more)  
     
    My bibliography  
     
    Export citation  
  4. A. M. Turing (1948). Practical Forms of Type Theory. Journal of Symbolic Logic 13 (2):80-94.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. 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 (3 more)  
     
    My bibliography  
     
    Export citation  
  6. A. M. Turing (1942). The Use of Dots as Brackets in Church's System. Journal of Symbolic Logic 7 (4):146-156.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Alan Mathison Turing (1939). Systems of Logic Based on Ordinals. London, Printed by C.F. Hodgson & Son, Ltd..
    No categories
     
    My bibliography  
     
    Export citation  
  8. A. M. Turing (1937). Computability and Λ-Definability. Journal of Symbolic Logic 2 (4):153-163.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. A. M. Turing (1937). The P-Function in Λ-K-Conversion. Journal of Symbolic Logic 2 (4):164.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Alan Turing (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42:230-265.
     
    My bibliography  
     
    Export citation