Home›Theory of Computation›Highest HonourBrowse ByHighest HonourFactsHighest HonourSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1936 CE 1Highest HonourACM FellowHighest Honour20 entriesACM Prize in ComputingHighest Honour2 entriesComputer Pioneer AwardHighest Honour2 entriesFellow of the Royal SocietyHighest Honour4 entriesFellow of the Royal Society of CanadaHighest Honour1 entryGodel PrizeHighest Honour12 entriesIEEE John von Neumann MedalHighest Honour4 entriesIEEE Medal of HonorHighest Honour1 entryIsrael Defense PrizeHighest Honour1 entryKnuth PrizeHighest Honour8 entriesKyoto PrizeHighest Honour2 entriesMarconi PrizeHighest Honour1 entryMember of the US National Academy of SciencesHighest Honour3 entriesNational Academy of Engineering MemberHighest Honour2 entriesNational Medal of ScienceHighest Honour1 entryNobel PrizeHighest Honour3 entriesTuring AwardHighest Honour18 entriesSources1. Wikipedia: Turing machinetier 2WikipediaTuring machine, lead section, theory-of-computation subcategory useQuote, Turing machine, lead section, theory-of-computation subcategory useThe Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine).View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.Reader Challenges (0)No disputes yet. Spotted an error or a better source? Open the first one.Sign in to dispute this or suggest a correction.