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:
| 主要作者: | |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2005
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/10912 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 總結: | 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. |
|---|