On computable numbers, with an application to the Entscheidungsproblem
暂无分享,去创建一个
[1] F. S. Prout. Philosophical Transactions of the Royal Society of London , 2009, The London Medical Journal.
[2] Nellie Clarke Brown. Trees , 1896, Savage Dreams.
[3] K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .
[4] A. Turing. Equivalence of Left and Right almost Periodicity , 1935 .
[5] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[6] Alan M. Turing,et al. Computability and λ-definability , 1937, Journal of Symbolic Logic.
[7] Alan M. Turing. Systems of Logic Based on Ordinals , 1938 .
[8] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .
[9] A. Turing. Finite Approximations to Lie Groups , 1938 .
[10] Logic based on Inclusion and Abstraction WV Quine , .
[11] Universal Turing,et al. Miscellaneous Front Pages J. Symbolic Logic Volume 13 Issue 2 (1948) , 2022 .
[12] Universal Turing,et al. The chemical basis of morphogenesis reprinted from Philosophical Transactions of the Royal Society ( Part B ) 237 37-72 ( 1953 ) Universal Turing Machine , .
[13] Proposed electronic calculator ; reprinted in ( Copeland 2005 ) Universal Turing Machine , .
[14] Collected Works : Mathematical Logic ( RO Gandy and CEM Yates , .
[15] Intelligent Machinery 1948 Report for National Physical Laboratory Universal Turing Machine , .
[16] Programmers ’ handbook for Manchester electronic computer Universal Turing Machine , .
[17] Proposed electronic calculator report for National Physical Laboratory Teddington , 2022 .
[18] Universal Turing,et al. Can Digital Computers Think?; Reprinted in (copeland 2004) , .