Shift overflow bouncer counter: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(init, add definition and examples)
(No difference)

Revision as of 18:57, 28 May 2024

Definition

Shift overflow bouncer counter is a 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