Alan Turing — "It is possible to invent a single machine which can be used to compute any compu…"
It is possible to invent a single machine which can be used to compute any computable sequence.
It is possible to invent a single machine which can be used to compute any computable sequence.
Click any product to generate a realistic preview. Up to 3 at a time.
* Initial load can take up to 90 seconds — revising the preview in another color is nearly instant.
"The machine has a definite state at any moment, which is determined by the instructions it has received and by the results of its previous operations."
"The game of cricket is one such example of a game which can be played against the computer."
"The question is not whether machines can think, but whether they can do something that we would call thinking."
"The original question, 'Can machines think?' I believe to be too meaningless to deserve discussion."
"I believe that in about fifty years' time it will be possible to programme computers, with a storage capacity of about 10^9, to make them play the imitation game so well that an average interrogator w…"
From his paper 'On Computable Numbers, with an Application to the Entscheidungsproblem'.
Date: 1936
PhilosophicalFound in 1 providers: gemini
1 source checked
Any calculation that can be defined by a finite set of rules can be performed by one universal machine — you don't need a separate device for each task. This single insight underpins every general-purpose computer ever built: one machine, infinite problems, all solvable through the right instructions.
Turing published this in his landmark 1936 paper introducing the theoretical 'Turing machine.' A mathematician who broke the Enigma cipher at Bletchley Park, he spent his life proving that intelligence and computation are formalizable. This quote captures his core conviction: thinking itself might be mechanized, a belief that defined his entire career.
In the 1930s, 'computers' were human clerks doing arithmetic by hand. No electronic computers existed. Turing wrote this during a foundational crisis in mathematics triggered by Gödel and Hilbert. His theoretical machine resolved key questions about what is provably computable, arriving just before WWII would demand exactly the mechanical codebreaking he had already imagined.
AI-generated insights based on extensive research and information for context. Factual errors? Email [email protected].
Your cart is empty