Evidence Performed by Alan Turing

  • Name
    Mathematical Logic and the Turing Machine
  • Description

    The global mathematical community lacked a definitive framework to resolve David Hilbert's decision problem regarding whether an absolute algorithm could determine the truth of any mathematical assertion. Alan Turing formulated the theoretical concept of a Universal Turing Machine to formally define the boundaries of mechanical calculation, proving mathematically that an absolute solution to the decision problem is impossible. His seminal 1936 paper established the foundational bedrock of theoretical computer science and permanently redefined the structural relationship between logic and mathematics.

  • Start Date
    1931-10-01
  • Duration
    5 years
  • Type
    Education
  • For
    King's College, University of Cambridge
  • Title
    Undergraduate Student and Research Fellow
  • Primary Responsibilities
    Conducted advanced research into foundational mathematical logic systems and abstract algebra. Formulated the mathematical concept of abstract computing machines running deterministic algorithms. Authored the historic paper On Computable Numbers, with an Application to the Entscheidungsproblem. Presented findings to academic bodies and earned a prestigious fellowship at King's College.

Used Skills