Everything about Turing machine examples

🧭 Start here: a 6-step reading path

1. Read the overview: Turing machine examplesA 5-minute orientation
2. Pick up a classic book: Invitation to Computer ScienceThe most-reprinted book on the subject
3. Read the landmark paper: Machine humour: examples from Turing test experimentsCited 8 times
4. Go sideways: Post–Turing machineA closely related topic
5. Go sideways: Turing's proofA closely related topic

🏆 Landmark papers (most cited)

• Machine humour: examples from Turing test experiments

  Huma Shah, Kevin Warwick · 2016 · AI & SOCIETY · 8 citations

📚 Books worth reading

• Invitation to Computer ScienceG. Michael Schneider, Judith L. Gersting · 1995
• Mathematical structures for computer scienceJudith L. Gersting · 1982
• Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
• Languages and machinesThomas A. Sudkamp · 1988
• The logician and the engineerPaul J. Nahin · 2012
• Snow mountain passageJames D. Houston · 2001
• Theoretical foundations of computer scienceDino Mandrioli · 1987
• Understanding Computers Today and TomorrowDeborah Morley · 2003

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Post–Turing machine A Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model…
• Turing's proof Turing's proof is a proof by Alan Turing submitted on 12 November 1936 and first published in 1937 with the title "On Computable Numbers, with an Application…
• Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…
• Wang B-machine As presented by Hao Wang (1954, 1957), his basic machine B is an extremely simple computational model equivalent to the Turing machine. It is "the first…
• Turing machine equivalents A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite…
• Busy beaver In theoretical computer science, a busy beaver is a Turing program that generates the longest finite output among all programs with the same number of…
• Universal Turing machine In computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in…
• Description number Description numbers are numbers that arise in the theory of Turing machines. They are very similar to Gödel numbers, and are also occasionally called "Gödel…