Sync bouncer counter: Difference between revisions
Jump to navigation
Jump to search
(init, add definition and examples) |
m (bold name) |
||
| Line 1: | Line 1: | ||
'''Sync bouncer counter''' is an informal class of Turing machines. A typical Turing machine in this class has the following behavior: | |||
Sync bouncer counter is | |||
* It has both a bouncer and a counter on the tape, and the lowest digit of the counter is adjacent to the bouncer. | * It has both a bouncer and a counter on the tape, and the lowest digit of the counter is adjacent to the bouncer. | ||
* Increment: the counter is increased by one, and the bouncer | * Increment: the counter is increased by one, and the bouncer finishes a period. | ||
* Overflow: when the counter overflows, the bouncer changes its structure (and change back before next overflow). | * Overflow: when the counter overflows, the bouncer changes its structure (and change back before next overflow). | ||
Revision as of 03:18, 24 July 2024
Sync bouncer counter is an informal class of Turing machines. A typical Turing machine in this class has the following behavior:
- It has both a bouncer and a counter on the tape, and the lowest digit of the counter is adjacent to the bouncer.
- Increment: the counter is increased by one, and the bouncer finishes a period.
- Overflow: when the counter overflows, the bouncer changes its structure (and change back before next overflow).
Examples
1RB0LF_0RC---_1RD1LE_0RE0LA_1LF0RF_0LC0LB (most common)