From Wikipedia, the free encyclopedia
No higher resolution available.
[edit] Summary
| Description |
English: The "3-state busy beaver" Turing Machine in a finite state representation. Each circle represents a "state" of the TABLE—an "m-configuration" or "instruction". "Direction" of a state transition is shown by an arrow. The label (e.g.. 0/P,R) near the outgoing state (at the "tail" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. 0) followed by a slash /, followed by the subsequent "behaviors" of the machine, e.g. "P Print" then move tape "R Right". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1965), Hill and Peterson (1974).
|
| Date |
28 March 2010(2010-03-28) |
| Source |
Own work |
| Author |
Diego Queiroz |
[edit] Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
 |
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
|
You may select the license of your choice.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment |
| current | 20:12, 28 March 2010 |  | 443 × 190 (5 KB) | Diego Queiroz | |
File usage
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):
This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.
If the file has been modified from its original state, some details may not fully reflect the modified file.