Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine
A discussion on the k-state, 2-symbol Turing Machine known as the Busy Beaver. It consists of a two-way infinite tape on which two symbols {0, 1} are written. A tape head can read or write these symbols into the tape one at a time depending on an operation determined by a set of instructions. Starti...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2005
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/10912 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | A discussion on the k-state, 2-symbol Turing Machine known as the Busy Beaver. It consists of a two-way infinite tape on which two symbols {0, 1} are written. A tape head can read or write these symbols into the tape one at a time depending on an operation determined by a set of instructions. Starting with a blank tape, the Busy Beaver writes a maximum number of 1s before reaching a halt state. The following values are noted: S(k) is the number of steps before the Busy Beaver comes to a halt and Σ(k) is the number of 1s that were written. |
|---|