Can Machine Think
暂无分享,去创建一个
[1] A. Turing. Some Calculations of the Riemann Zeta-Function , 1953 .
[2] On Computable Numbers. . . Proc Universal Turing Machine , 2022 .
[3] Alan M. Turing,et al. Computability and λ-definability , 1937, Journal of Symbolic Logic.
[4] A. Turing. THE WORD PROBLEM IN SEMI-GROUPS WITH CANCELLATION , 1950 .
[5] A. M. Turing. The $\mathfrak{p}$-Function in $\lambda-K$-Conversion , 1937 .
[6] A. M. Turing,et al. The chemical basis of morphogenesis , 1952, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.
[7] Universal Turing,et al. Can Digital Computers Think?; Reprinted in (copeland 2004) , 2022 .
[8] Sergio J. Alvarado. AAAI 1991 spring symposium series reports , 1991 .
[9] A. M. Turing,et al. Review: Arthur W. Burks, The Logic of Programming Electronic Digital Computers , 1953 .
[10] Intelligent Machinery 1948 Report for National Physical Laboratory Universal Turing Machine , 2022 .
[11] Alan M. Turing,et al. Practical forms of type theory , 1948, Journal of Symbolic Logic.
[12] A. Turing. Artificial Intelligence : Usfssg Computers to Think about Thinking . Part 1 , 1983 .
[13] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[14] A. M. Turing,et al. Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.
[15] Martin Davis,et al. The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .
[16] B. van Rootselaar,et al. Dictionary of Scientific Biography XIII , 1976 .
[17] Alan M. Turing,et al. Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.
[18] Collected Works: Mathematical Logic (RO Gandy and CEM Yates Editors) , 2022 .
[19] A. Turing. ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .
[20] Nellie Clarke Brown. Trees , 1896, Savage Dreams.
[21] A Diffusion Reaction Theory of Morphogenesis , 1952, Nature.
[22] A. M. Turing,et al. Solvable and Unsolvable Problems , 1954 .
[23] A. Turing. A method for the calculation of the zeta-function Universal Turing Machine , 2011 .
[24] V. Tugarinov. CAN A MACHINE THINK. , 1965 .
[25] A. Turing. Finite Approximations to Lie Groups , 1938 .
[26] A. Turing. The chemical basis of morphogenesis , 1952, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.
[27] A. M. Turing,et al. Local programming methods and conventions , 1989 .
[28] I. A. Dorobantu,et al. The Physical Basis of Morphogenesis , 1989 .
[29] A. Turing. Equivalence of Left and Right almost Periodicity , 1935 .
[30] Logic based on Inclusion and Abstraction WV Quine , 2022 .
[31] A. M. Turing,et al. Checking a large routine , 1989 .
[32] Markus Voelter,et al. State of the Art , 1997, Pediatric Research.
[33] A. Turing. Lecture to the London Mathematical Society on 20 February 1947. 1986. , 1995, M.D. computing : computers in medical practice.
[34] John Tyler Bonner,et al. Morphogenesis , 1965, The Physics of Living Matter: Space, Time and Information.
[35] Alan M. Turing,et al. The use of dots as brackets in Church's system , 1942, Journal of Symbolic Logic.
[36] Universal Turing,et al. Miscellaneous Front Pages J. Symbolic Logic Volume 13 Issue 2 (1948) , 2022 .
[37] Proposed Electronic Calculator report for National Physical Laboratory Teddington Universal Turing Machine , 2022 .
[38] Computer machinery and intelligence Universal Turing Machine , 2022 .
[39] Proposed electronic calculator ; reprinted in ( Copeland 2005 ) Universal Turing Machine , 2022 .
[40] Jean-Baptiste Lully,et al. The collected works , 1996 .
[41] 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 , 2022 .
[42] A. M. Turing,et al. APPENDIX One (A) – On Computable Numbers, with an Application to the Entscheidungsproblem , 1960 .