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:
“Histories are more full of examples of the fidelity of dogs than of friends.”
—Alexander Pope (1688–1744)
“Histories are more full of examples of the fidelity of dogs than of friends.”
—Alexander Pope (1688–1744)
“But I am not tragically colored. There is no great sorrow dammed up in my soul, nor lurking behind my eyes. I do not mind at all. I do not belong to the sobbing school of negrohood who hold that nature somehow has given them a lowdown dirty deal.... No, I do not weep at the world—I am too busy sharpening my oyster knife.”
—Zora Neale Hurston (1907–1960)
“The mission of men there seems to be, like so many busy demons, to drive the forest all out of the country, from every solitary beaver swamp and mountain-side, as soon as possible.”
—Henry David Thoreau (1817–1862)
“The machine has had a pernicious effect upon virtue, pity, and love, and young men used to machines which induce inertia, and fear, are near impotents.”
—Edward Dahlberg (1900–1977)