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
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. A. M. Turing (1996). Intelligent Machinery, a Heretical Theory. Philosophia Mathematica 4 (3):256-260.
  3. A. M. Turing (1953). Review: Arthur W. Burks, The Logic of Programming Electronic Digital Computers. [REVIEW] Journal of Symbolic Logic 18 (2):179-179.
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. A. M. Turing (1948). Practical Forms of Type Theory. Journal of Symbolic Logic 13 (2):80-94.
    Direct download (6 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 (6 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 (5 more)  
     
    My bibliography  
     
    Export citation  
  7. A. M. Turing (1937). Computability and Λ-Definability. Journal of Symbolic Logic 2 (4):153-163.
  8. A. M. Turing (1937). Computability and $Lambda$-Definability. Journal of Symbolic Logic 2 (4):153-163.
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. A. M. Turing (1937). The P-Function in Λ-K-Conversion. Journal of Symbolic Logic 2 (4):164.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. A. M. Turing (1937). The $Mathfrak{P}$-Function in $Lambda-K$-Conversion. Journal of Symbolic Logic 2 (4):164-164.
    Direct download  
     
    My bibliography  
     
    Export citation