Alan Turing

English computer scientist (1912–1954)

abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules

test of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human

computer science award

thesis about the nature of computable functions

British statistician and cryptographer (1916–2009)

National Measurement Institution of the United Kingdom

a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)

thumb|220px|A wartime picture of a Bletchley Park Bombe

British early electronic serial stored-program computer

mathematician and popular science author

British mathematician and economist

concept in computability theory

measurement for the level of algorithmic unsolvability of a set

2017 British law pardoning formerly-illegal sex acts

programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks

thumb|upright=1.2|The 1952 game between Turochamp (White) and Alick Glennie (Black). After 29 moves, White is one pawn up but about to lose its Pin (chess)|pinned Queen on the next move. Therefore, White resigns.

how patterns in nature, such as stripes and spots, can arise naturally and autonomously from a homogeneous, uniform state

research institute in Britain

programming language

stronger, physical form of the Church–Turing thesis, that a universal Turing machine can simulate every physical process

Banburismus was a cryptanalytic process developed by Alan Turing at Bletchley Park in Britain during the Second World War. It was used by Bletchley Park's Hut 8 to help break German Kriegsmarine (naval) messages enciphered on Enigma machines. The process used sequential conditional probability to infer information about the likely settings of the Enigma machine. It gave rise to Turing's invention of the ban as a measure of the weight of evidence in favour of a hypothesis. This concept was later applied in Turingery and all the other methods used for breaking the Lorenz cipher.

graph Machine

1952 article by Alan Turing