Examples of Busy Beaver Turing Machines
For an example of a 3-state busy beaver's state table and its "run" see Turing machine examples.
These are tables of rules for the Turing machines that generate Σ(1) and S(1), Σ(2) and S(2), Σ(3) (but not S(3)), Σ(4) and S(4), and the best known lower bound for Σ(5) and S(5), and Σ(6) and S(6).
In the tables, columns represent the current state and rows represent the current symbol read from the tape. Each table entry is a string of three characters, indicating the symbol to write onto the tape, the direction to move, and the new state (in that order). The Halt state is shown as H.
Each machine begins in state A with an infinite tape that contains all 0s. Thus, the initial symbol read from the tape is a 0.
Result Key: (starts at the position underlined, halts at the position in bold)
Read more about this topic: Busy Beaver
Famous quotes containing the words examples of, examples, busy, beaver and/or machines:
“It is hardly to be believed how spiritual reflections when mixed with a little physics can hold people’s attention and give them a livelier idea of God than do the often ill-applied examples of his wrath.”
—G.C. (Georg Christoph)
“No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
—André Breton (1896–1966)
“Keep always busy so that the devil will find you always engaged.”
—Jerome (c. 340–420)
“I saw young Harry with his beaver on,
His cuisses on his thighs, gallantly armed,
Rise from the ground like feathered Mercury,
And vaulted with such ease into his seat
As if an angel dropped down from the clouds
To turn and wind a fiery Pegasus,
And witch the world with noble horsemanship.”
—William Shakespeare (1564–1616)
“Gee, I wish we had one of them doomsday machines things.”
—Stanley Kubrick (b. 1928)