A Turing Machine - Overview

A Turing machine is a math concept that show that a few simple rules can be used to solve any computable computation. It is the basis for all of today's computers. My goal in building this project was to create a machine that embodied the classic look and feel of the machine presented in Alan Turings 1937 paper on computable numbers. More information can be found at: http://aturingmachine.com

• Category

  Science & Technology

[KCYinoz]

This is a beautiful work of art and a great tribute to Alan Turing.

This makes my effort very modest: I don't know if I can leave a link though.

[Mike Davey]

I would love to see what you have done. You can contact me from my web site listed above, and leave the link. I will link to you from my site. Mike

[galt57]

The problem I have is understanding what is so significant about this machine. Yes I'm sure it can count in binary but that is just a little too trivial. I would like to see some Turing tables for solving some standard problems.

[Mike Davey]

Example programs are on the website listed above. A number of Turing tables are on the site along with explanations and video.

[kilometerakhir]

i came here (after wiki) because of google doodle :D

[Rajamanickam Antonimuthu]

Nice video. Today (June 23 rd, 2012) Google is showing Doodle for the 100th Birthday of Alan Turing who invented the Turning Machine. Refer RtoZ.org for more details.

[JosephKnight93]

The significance of this machine is that it can compute everything that can possibly be computed - including your brain! The discovery of turing-complete systems was the most important discovery ever made by humans.

[ufoengines]

Very Cool!

I read that the German Z1 computer used old 35 mm movie film in it's design.

Can a Turing Machine be built using Fluidics, or powered by a Tesla Turbine?

[Suran Fox]

A very well build machine. cool!

[Martín Tirado]

Awesome machine, I want it

[Mohammed Kashim]

This is so awesome. 

[lazyfreedom98]

if twitter is text witness then turning is terminator 

[Frederick Burbon]

The design may be oriented by the 26 bounded alphabet. A solution to this is to use only two symbols that can express values with informative distinctions. A can be represented by 1000000 and B as 1000001. This is possible by sending the raw binary value to a subprocess in the mainprocess of the TM. This is one of the many ways a TM can simulate the behaviour of computers. The point of a TM is to create a design that can automate math problems. Computers are turing machines as well.

[Frederick Burbon]

if you'd like, you can try designing a turing machine that will sort binary numbers

at the time of its creation, a turing machine (TM) is meant to be an imaginary machine that will solve mathematical or computable problems.

despite having the infinite memory of a TM, the designer of a turing machine may be limited to the symbols he uses. Ex, a person will think TM can only recognize letters by storing 26 distinct symbols. The problem is states have to cater to those 26 symbols.

[saraha180]

This is so cool!