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)
“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)
“Friendship should be surrounded with ceremonies and respects, and not crushed into corners. Friendship requires more time than poor busy men can usually command.”
—Ralph Waldo Emerson (1803–1882)
“This ferry was as busy as a beaver dam, and all the world seemed anxious to get across the Merrimack River at this particular point, waiting to get set over,—children with their two cents done up in paper, jail-birds broke lose and constable with warrant, travelers from distant lands to distant lands, men and women to whom the Merrimack River was a bar.”
—Henry David Thoreau (1817–1862)
“In Hell all the messages you ever left on answering machines will be played back to you.”
—Judy Horacek (b. 1961)