Hand-drawn picture of Turing Machine

Videos of Mechanical and Electronic Turing Machines

A mechanical Turing Machine built by Mike Davey with a very impressive Read/Write head. Comment under the video has a link to information about it, including the hardware used to build it, the software used to control it (which you can download if you wish), plus more videos of specific examples.
Professor Doug Clark of Princeton Engineering is proud to show the Turing Machine his father built.

LEGO Turing Machines

Turing Machine filmed by Andre Theelen. An article in Wired magazine also gives a description of it with links to further information.
This video of a Turing Machine by Anders Nissen has exciting background music.

Minecraft Turing Machines

The video of this Turing Machine by neonsignal is running at 60 times the normal speed.

Turing Machine Software Simulators on the Internet

Turing Machine Simulator written by Anthony Morphet in JavaScript, similar to the Sir Roger Penrose type Turing Machine.
Turing Machine Simulator written by Paul Rendell, easy to learn and use, complete with built-in examples.
Another Turing Machine Simulator written by Paul Rendell in JavaScript. This is an easier version of the one above. It has three different Turing Machines that you can run and see how they operate.
A video of a Turing Machine implemented in Conway’s Game of Life designed by Paul Rendell.
Video of a Turing Machine Simulator by Michael Gourlay. This video has interesting background music.
Website with information about the Turing Machine Simulator shown in the video above. From this website you can download an mp4 and a zip file. It was written in C by Michael Gourlay and was meant to run on older PC’s that didn’t have the graphic capabilities available today.
This video shows how a Turing Machine by Nakarin Jupattanakul accepts palindromes. The background music for this video starts with Frederic Chopin’s Funeral March.
Website with information about the Turing Machine Simulator shown in the video above. It has links to the Java source code and other information.
Explanation of an implementation of a Turing Machine in Forms/3.
Directions on how to build a Turing Machine. This is one in a series of tutorials about using JFLAP. Before doing the tutorial on building a Turing Machine, it would be a good idea to first go through the tutorial Building Your First Finite Automaton. For these tutorials, you’ll need to download JFLAP from jflap.org. It’s probably also a good idea to have a copy of the book JFLAP: An Interactive Formal Languages and Automata Package by Susan H. Rodger and Thomas W. Finley (2006, Jones and Bartlett Publishers, Inc.).
You can purchase a software simulator of an Uber Turing Machine for $9.95 to run on your own computer. It is meant for students, academics, and programming enthusiasts. It is sold by the SOFTPEDIA which sells many other apps for your computer as well.
The University of Cambridge Computer Laboratory website has a tutorial on how to build a Raspberry Pi Turing Machine. In case you’re unfamiliar with the Raspberry Pi, it’s a very small inexpensive computer, and here’s a YouTube video that explains what it is.

Turing Machines implemented in the Wolfram Language

Wolfram Research has several interesting Turing Machines. You can download two of them from Wolfram MathWorld as notebook files, and you can then work with these files using Wolfram Mathematica. Links to other Wolfram Turing Machines can be found on one of the Documentation pages for the Wolfram Language. It is worth mentioning that Wolfram Science awarded a $25,000 prize to Alex Smith for constructing the world’s smallest Universal Turing Machine. This Turing Machine is of the type “(2,3) Turing Machine” which is explained in Wikipedia. There is also another entry in Wikipedia that gives more information about Universal Turing Machines and the attempts to construct the smallest one.

Turing Machines implemented in Excel

There are two Turing Machines implemented in Excel by Felienne and her team, One increments a number by one, and the other raises a number to a power. The data is in unary notation. You can download both Excel files and experiment with them. Directions and explanations are on the website. Both Turing Machines are an excellent demonstration of what can be done using Excel formulas alone. You can get more of a variety of Turing Machines with the Excel file downloadable from the Home page of this website, but for that I had to do some VBA programming.
Explanation of how Felienne implemented the Turing Machine in Excel.
Here is a YouTube video demonstrating a Turing Machine implemented in Excel by Paul Haworth. There is also a YouTube Channel by Paul Haworth with several links to other impressive-looking simulations, all done in Excel.

Links to Alan Turing's Original Paper

Alan Turing’s research paper On Computable Numbers, with an Application to the Entscheidungsproblem appeared in the Proceedings of the London Mathematical Society. Alan Turing later published A Correction to that paper in that same journal as well. If you are a subscriber to the Proceedings of the London Mathematical Society, or if you have access to it via your Institution, you can view these research papers for free and see them as they were originally published.

However, if you simply Google the title of the paper, you’ll find that copies of this paper exist in many places all over the internet. (Some of these websites are listed below.) This may not be too surprising, since this research paper is one of the great landmarks in the history of mathematics, so you would expect that it is being read and reread by many people.

There is a book that contains not only Alan Turing’s famous paper in its entirety, along with his latter published correction (and also further corrections by other mathematicians), but also other papers and correspondences written by Turing during his lifetime. It is the book The Essential Turing edited by B. Jack Copeland (Oxford University Press, 2013). For example: It includes Alan Turing’s letter to Winston Churchill, in which he requested additional resources needed to crack the German Enigma; Turing’s famous article “Computing Machinery and Intelligence” that appeared in Mind (1950), pp. 433-60, where he proposed “The Imitation Game” (more commonly known today as “The Turing Test”) as a way of deciding whether a computer has the intelligence of a human; as well as other articles about Chess, Artificial Intelligence, Artificial Life, Solvable and Unsolvable Problems, and others.

As is well known to graduate students in mathematics, published research papers are notoriously terse, leaving the details and computations to be completed by the reader. For that reason, such papers are often read with the help of a pencil and paper, and it often takes days to get through a single page. Furthermore, for papers having long expressions of mathematical symbols, it is not uncommon for typos to somehow creep in on the way to publication. Experts in the field will easily recognize the typos, but others may end up questioning their own sanity. Therefore, if you seriously intend to read and understand Alan Turing’s “On Computable Numbers, with an Application to the Entscheidungsproblem”, then I strongly recommend that you read the book The Annotated Turing by Charles Petzold (Wiley Publishing, Inc., 2008), where the author first prepares you with all the information you need before you can start reading the paper, and then proceeds through the entire paper, giving ample explanations after almost every line or paragraph, and pointing out the typos as he corrects them.
One way to get a copy of Alan Turing’s original paper is to first go to the webpage on Alan Turing in Wikipedia. If you scroll down to almost the bottom of that page, you’ll see a heading Works of Turing and under it the line “Alan Turing’s publications indexed by Google Scholar.” In that line, if you click on the link Alan Turing’s publications, then it’ll take you to a page where you can click on links to Alan Turing’s papers. Then, if you click on the link On computable numbers, with an application to the Entscheidungsproblem, it will take you to a page that has a link to a copy of this paper as a pdf file.
This website in French is devoted to a Turing Machine built by Marc Raynaud. Among its many links is a page with 18 videos and a link to Alan Turing’s original paper.
Here is another webpage with Alan Turing’s original paper. It is part of an interesting website with links to many interesting topics. This website is maintained by abelard, who claims to “live in a ger on the steppes of outer mongolia, surrounded by an indeterminate number of yaks, …”

Other Worthwhile Links Pertaining to Turing Machines

This webpage, with the use of many links, outlines the chronology of events in mathematics that led Alan Turing to writing his famous paper on the Turing Machine. It itself is a page from a website about Alan Turing maintained by the renowned Turing biographer, Andrew Hodges.
A biography of Alan Turing by B. Jack Copeland and Diane Proudfoot, with emphasis on Turing’s role in the invention and development of the computer.
Cartoon about the Halting Problem. Below the video, there is a link to a site with further explanations.
Video that shows that some infinities are bigger than other infinities. (Demonstrates the Diagonalization argument.)
Explanation of Decision Problem
Here is a Turing Machine Primer, intended for readers who are familiar with Automata Theory.
Version 1.0 -- May 12, 2017