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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-13141 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-131412023-10-03T00:33:52Z Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine Pedro, Ana Marian M. 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. 2005-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/10912 Faculty Research Work Animo Repository Turing machines Sequential machine theory Computer Sciences Theory and Algorithms |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Turing machines Sequential machine theory Computer Sciences Theory and Algorithms |
| spellingShingle |
Turing machines Sequential machine theory Computer Sciences Theory and Algorithms Pedro, Ana Marian M. Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| description |
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. |
| format |
text |
| author |
Pedro, Ana Marian M. |
| author_facet |
Pedro, Ana Marian M. |
| author_sort |
Pedro, Ana Marian M. |
| title |
Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| title_short |
Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| title_full |
Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| title_fullStr |
Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| title_full_unstemmed |
Two symbol finite state machines: The busy beaver: A k-state, 2-symbol Turing machine |
| title_sort |
two symbol finite state machines: the busy beaver: a k-state, 2-symbol turing machine |
| publisher |
Animo Repository |
| publishDate |
2005 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/10912 |
| _version_ |
1779260509252485120 |