• Publications
  • Influence
Computing Machinery and Intelligence
  • A. Turing
  • Computer Science
  • The Philosophy of Artificial Intelligence
  • 1 October 1950
TLDR
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 the question, “Can machines think?” is to be sought in a statistical survey such as a Gallup poll. Expand
Computing Machinery and Intelligence.
TLDR
The question, “Can machines think?” is considered, and the question is replaced by another, which is closely related to it and is expressed in relatively unambiguous words. Expand
The chemical basis of morphogenesis
  • A. Turing
  • Mathematics
  • Philosophical Transactions of the Royal Society…
  • 14 August 1952
It is suggested that a system of chemical substances, called morphogens, reacting together and diffusing through a tissue, is adequate to account for the main phenomena of morphogenesis. Such aExpand
Checking a large routine
Computability and λ-Definability
  • A. Turing
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1 December 1937
TLDR
The purpose of the present paper is to show that the computable functions introduced by the author are identical with the λ-definable functions of Church and the general recursive functions due to Herbrand and Godel and developed by Kleene. Expand
Solvable and Unsolvable Problems
Systems of Logic Based on Ordinals
These documents can only be used for educational and research purposes (“Fair use”) as per U.S. Copyright law (text below). By accessing this file, all users agree that their use falls within fairExpand
Practical Forms of Type Theory
  • A. Turing
  • Philosophy, Computer Science
  • J. Symb. Log.
  • 1 June 1948
TLDR
This work disprove not only that the famous embedded algorithm for the improvement of model checking by Ivan Sutherland et al. is optimal, but that the same is true for cache coherence. Expand
Can Automatic Calculating Machines Be Said to Think
TLDR
The focus in this paper is on constructing a pervasive tool for evaluating Internet QoS (HolHoveling) and whether the infamous certifiable algoritm for the refinement of thin clients by P. Jackson et al. is recursiv ely enumerable. Expand
The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma
Alan Turing 1912-1954 Computable Numbers: A Guide 1. On Computable Numbers, with an Application to the Entscheidensproblem (1936) 2. On Computable Numbers: Corrections and Critiques 3. Systems ofExpand
...
1
2
3
4
5
...