Shift overflow bouncer counter: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
m (→‎Definition: fixed a minor grammar error)
mNo edit summary
Line 10: Line 10:
* [https://bbchallenge.org/1RB0RF_1LC1RB_0RD0LB_---0LE_1RE0RA_1RD1RE 1RB0RF_1LC1RB_0RD0LB_---0LE_1RE0RA_1RD1RE]
* [https://bbchallenge.org/1RB0RF_1LC1RB_0RD0LB_---0LE_1RE0RA_1RD1RE 1RB0RF_1LC1RB_0RD0LB_---0LE_1RE0RA_1RD1RE]
* [https://bbchallenge.org/1RB3LA3LB1RA3RA_2LA2LB---4RA4LA 1RB3LA3LB1RA3RA_2LA2LB---4RA4LA]
* [https://bbchallenge.org/1RB3LA3LB1RA3RA_2LA2LB---4RA4LA 1RB3LA3LB1RA3RA_2LA2LB---4RA4LA]
[[Category:Stub]]
[[Category:Zoology]]

Revision as of 10:31, 25 August 2024

Definition

Shift overflow 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.
  • Increment: when the bouncer finish a loop, the counter is increased by one.
  • Overflow: when the counter overflows, the bouncer is reset to nearly empty, and the original location of the bouncer becomes part of the counter (this is imprecise and sometimes it has more complex behavior).

Examples