## Recent publications

On computable numbers, with an application to the Entscheidungsproblem

Alan Mathison Turing

Journal of Mathematics, pp. 345-363

Rounding-off errors in matrix processes

Alan Mathison Turing

The Quarterly Journal of Mechanics and Applied Mathematics, vol. 1(1), 1948, pp. 287-308

Computability and lambda-definability (1937)

Alan Mathison Turing

Journal of Mathematics, vol. 2(4), 1937 Dec, pp. 153-163

## Projects

A Turing machine is an abstract "machine" that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device. Despite the model's simplicity, given any computer algorithm, ...

The Turing test is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human. Alan Turing proposed that a human evaluator would judge natural language conversations between a human and a mac...

At Bletchley Park, Turing had specified an electromechanical machine that could help break Enigma more effectively than the Polish bomba kryptologiczna, from which its name was derived. The bombe, with an enhancement suggested by mathematician Gordon W...

Banburismus Cryptanalytic Process

Banburismus was a cryptanalytic process developed by Alan Turing at Bletchley Park in England 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 proce...

Turingery or Turing's Method (playfully dubbed Turingismus by Peter Ericsson, Peter Hilton and Donald Michie) was a hand codebreaking method devised in July 1942 by the mathematician and cryptanalyst Alan Turing at the British Government Code and Cyphe...