Bell eats counter: Difference between revisions
Jump to navigation
Jump to search
(init, add definition and examples) |
m (→Examples) |
||
| Line 12: | Line 12: | ||
[https://bbchallenge.org/1RB0LE_0RC---_1LC0RD_0RB1RA_1LF1LE_0LA1LF 1RB0LE_0RC---_1LC0RD_0RB1RA_1LF1LE_0LA1LF] (more complex than typical ones) | [https://bbchallenge.org/1RB0LE_0RC---_1LC0RD_0RB1RA_1LF1LE_0LA1LF 1RB0LE_0RC---_1LC0RD_0RB1RA_1LF1LE_0LA1LF] (more complex than typical ones) | ||
[https://bbchallenge.org/1RB3LB---3RA0LA_2LA3LB4RB1RB2RA 1RB3LB---3RA0LA_2LA3LB4RB1RB2RA] | |||
Revision as of 14:19, 29 May 2024
Definition
Bell eats counter is a informal class of Turing machines. A typical Turing machine in this class has the following behavior:
- It has both a bell and a counter on the tape.
- Increment: when the bouncer in the bell finish a period, the counter is increased by one.
- Overflow: when the bouncer in the bell overflows, the bell eats the lowest digit of the counter (the counter is halved), and the bouncer in the bell is reset.
Examples
1RB1RE_0RC1RD_1LA1RC_1LC---_1LF0RE_0LF0LA
1RB---_1RC0RA_1LD1RA_1LE0LD_0RE1RF_0RB0LF
1RB0LE_0RC---_1LC0RD_0RB1RA_1LF1LE_0LA1LF (more complex than typical ones)