Remember my article on The Busy Beaver Problem? Well, someone built a real Turing Machine and decided to run the busy beaver with 4 states on it. Here is the video.

The Turing Machine in this video runs for 107 steps and halts with the total of 13 ones, as expected.

In my article on The Busy Beaver Problem, I also wrote a program that visualizes the tape changes. If you follow the video closely, you'll see that they match the visualization (black square stands for 1, white for 0).

Tape changes for 4 state busy beaver.

See A Turing Machine website for more videos and information about how this machine was actually built. Also see my article on Busy Beaver for a Turing Machine implementation in Python and C++.


March 30, 2010, 09:51

Very interesting Turing Machine in reality :)

March 31, 2010, 04:15

Very nice video

April 15, 2010, 13:10

Video is not available.

April 16, 2010, 16:12

Fixed it. I had the article parser lower-case the tags together with urls. Turned out youtube urls were case sensitive.

Leave a new comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Type the word "lcd_210": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.