Turing Machines

Have you ever used a Turing Machine?

In the mid 1930s Alan M. Turing conceived the idea of an extremely simple device that could perform any calculation with three simple instructions and one simple test. He was not interested in devising technology; he wanted to prove or disprove Das Entscheidungsproblem .

So Turing postulated and built what he called “Turing Machines”. In order to test or prove these machines he then devised what he called “A Universal Turing Machine”

We start off with a sheet of paper and a paper ribbon and execute or interpret some simple Turing Machines that can count sheep. (You won’t fall asleep!)

Then we look at a progression of Turing Machines that can multiply and divide strings of Roman Numbers (“What is MX multiplied by MMXX?”)

We go home and make use of Universal Turing machines every day for the rest of our lives.

Starter Kit - Increment Unary

Starter Kit - Decrement Unary

Search