Shift overflow bouncer counter: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Int-y1 (talk | contribs)
No edit summary
Polygon (talk | contribs)
m grammar fix
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
{{Stub}}
A '''shift overflow bouncer counter''' is an informal class of Turing machines. A typical Turing machine in this class has the following behavior:
A '''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.
* It has both a bouncer and a counter on the tape.
* Increment: when the bouncer finish a loop, the counter is increased by one.
* Increment: when the bouncer finishes 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).
* 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).


Line 10: Line 11:
* {{TM|1RB3LA3LB1RA3RA_2LA2LB---4RA4LA}}
* {{TM|1RB3LA3LB1RA3RA_2LA2LB---4RA4LA}}


[[Category:Stub]]
[[Category:Zoology]]
[[Category:Zoology]]

Latest revision as of 17:20, 31 March 2026

A 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 finishes 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