Alan Turing developed a precise machine model of effective computation in On Computable Numbers, with an Application to the Entscheidungsproblem by Alan Turing. A Turing machine combines a finite set of control states with an unbounded tape and local read/write moves; this permits mathematical questions about what an algorithm can compute, rather than tying computation to one physical device. His universal-machine construction is foundational to computability theory.[ref]
https://www.kings.cam.ac.uk/alan-mathison-turing-1912-54. King's College archival account, computable numbers and universal machine
His later The chemical basis of morphogenesis by Alan Turing connects reaction–diffusion systems with the formation of spatial patterns.
Portrait of Alan Turing
. Unknown photographer; existing Commons crop by David Levy from Alan Turing az 1930-as években.jpg. Public domain in the UK under Commons' PD-UK-unknown statement; Commons flags possible US copyright restored under URAA. No worldwide free-license claim. Source and usage information on the linked Wikimedia file page. Source. Articles by others on the same topic
Alan Turing was a British mathematician, logician, cryptanalyst, and computer scientist, widely regarded as one of the fathers of computer science and artificial intelligence. Born on June 23, 1912, Turing made significant contributions to various fields, including mathematics, logic, and computer science. One of his most notable accomplishments during World War II was his work at Bletchley Park, where he played a crucial role in breaking the German Enigma code.
