Meetings: Attendees: Computational Complexity Theorists

Alan Turing

Alan Turing, the father of computer science, was a true pioneer in the field of computational complexity. His work on the theoretical foundations of computation and the development of the theoretical model of the Automatic Computing Machine (the precursor to the modern computer) has had a lasting impact on the field.

His work on the halting problem, in particular, showed that there cannot exist an algorithm to determine whether a given program will run forever or not, and his work on the computability of real numbers has been widely cited.

Today, we honor his memory and legacy as a computational complexity theorist extraordinaire.

Turing's Legacy Complexity and Algorithmists Turing's Algorithmic Thinking