Today is the 100th birthday of wartime code-breaker and pioneer of computer science Alan Mathison Turing. My collection of links about Turing, his ideas, his life, his machine, and related topics.
Alan Mathison Turing, OBE, FRS ( /ˈtjʊərɪŋ/ tewr-ing; 23 June 1912 – 7 June 1954), was an English mathematician, logician, cryptanalyst and computer scientist. He was highly influential in the development of computer science, providing a formalisation of the concepts of “algorithm” and “computation” with the Turing machine, which played a significant role in the creation of the modern computer. Turing is widely considered to be the father of computer science and artificial intelligence.
COMPUTING MACHINERY AND INTELLIGENCE
Turing, A.M. (1950). Computing machinery and intelligence. Mind, 59, 433-460
A Turing Machine built using LEGO
In honor of the Alan Turing year 2012
Turing Round Up
Una máquina de Turing de Lego
Para conmemorar el centenario del nacimiento del matemático y pionero de la informática Alan Turing unos aficionados han construido esta Máquina de Turing hecha con piezas de Lego,
El legado de un científico visionario
When Did That Happen?
During the first or second week of December 1942—it’s impossible to be more precise—three men met for lunch at the Hay-Adams House in Lafayette Square in Washington, D.C. All of the men were geniuses and each of the three made separate, landmark contributions to the creation of electronic computers in the twentieth century.
Maquinaria computadora e inteligencia
Embracing Uncertainty: The new machine intelligence
How Dr. Seuss would prove the halting problem undecidable
Alan Turing: Una historia de nazis y matemáticas
World War II Enigma Buster Alan Turing Commits Suicide
Alan Turing and the Electric Monk Overlords
Turing Test online
Turing award goes to ‘machine learning’ expert
The Halting Problem
Turing Machines were not the first model of computability, but they were the first model which viscerally captured the idea of computation, in a really tangible way that meshed with intuition. Turing’s model of computability is computationally equivalent to those of Church and Kleene, but even an expert logician has trouble imagining a physical real-life machine for lambda calculus.
Infinite Time Turing Machines
Watson, Turing, and extreme machine learning
The real value of the Watson supercomputer will come from what it inspires.
Turing Completeness Considered Harmful: Component Programming with a Simple Language
Why you need to be excited about SpyParty
If you want to look at it in the kookiest way possible, it’s actually a game based around the Turing test.
A Turing Machine
In Alan Turing’s 1936 paper on computable numbers, he presented a thought experiment. Turing describes a machine that has an infinitely long tape upon which it writes, reads and alters symbols. He further shows that a machine with the correct minimal set of operations can calculate anything that is computable, no matter the complexity.
Construye tu propia Máquina de Turing
Some of the earliest ideas on how physical and mathematical processes and constraints affect biological growth, and hence natural patterns such as the spirals of phyllotaxis, were written by D’Arcy Wentworth Thompson and Alan Turing. These works postulated the presence of chemical signals and physico-chemical processes such as diffusion, activation, and deactivation in cellular and organismic growth.
Chuck Thacker Attains Computing’s Peak
A Talk With Charles Thacker, the Turing Winner
Barbara Liskov wins Turing Award
ACM cites ‘foundational innovations’ in programming language design
A Lambda-Calculus Turing Machine
The Shortest Universal Machine Implementation
Gregory Chaitin is well known for his work on metamathematics and for the celebrated Ω number, which shows that God plays dice in pure mathematics.
Turing Centenary Lecture
Alan Turing: From Computers to Life
Three beliefs that lend illusory legitimacy to Cantor’s diagonal argument
Cantor’s diagonal argument, Gödel’s proof, and Turing’s Halting problem
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithm. They are used to discuss computability without referring to any concrete model of computation such as Turing machines or register machines.
In computability theory, the halting problem can be stated as follows: Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever.
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.
Omega and why maths has no TOEs
by Gregory Chaitin
The Turing Archive for the History of Computing
Angel “Java” Lopez