Shift overflow counter: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(No longer fifth longest running TM)
m (Made capitalization and punctuation consistent)
Line 1: Line 1:
'''Shift overflow counter''' is an informal class of Turing machines. A typical Turing machine in this class has the following behavior:
'''Shift overflow counter''' is an informal class of Turing machines. A typical Turing machine in this class has the following behavior:


* it represents digits as short fixed-length blocks of symbols
* It represents digits as short fixed-length blocks of symbols.
* it spends most of its time implementing basic double counter until one of the sides overflows (expands) which leads to changing the offsets of blocks, making them non-valid representations of digits
* It spends most of its time implementing basic double counter until one of the sides overflows (expands) which leads to changing the offsets of blocks, making them non-valid representations of digits.
* after “Counter Phase” there is a “Reset Phase” where the contents are “reparsed”, creating a new double counter configuration. The new configuration could lead to halting.
* After “Counter Phase” there is a “Reset Phase” where the contents are “reparsed”, creating a new double counter configuration. The new configuration could lead to halting.


Note: some examples (like the halting shift-overflow counters below) use a counter on one side and a [[bouncer]] (sometimes called unary counter) on the other.
Note: some examples (like the halting shift-overflow counters below) use a counter on one side and a [[bouncer]] (sometimes called unary counter) on the other.

Revision as of 14:39, 5 August 2025

Shift overflow counter is an informal class of Turing machines. A typical Turing machine in this class has the following behavior:

  • It represents digits as short fixed-length blocks of symbols.
  • It spends most of its time implementing basic double counter until one of the sides overflows (expands) which leads to changing the offsets of blocks, making them non-valid representations of digits.
  • After “Counter Phase” there is a “Reset Phase” where the contents are “reparsed”, creating a new double counter configuration. The new configuration could lead to halting.

Note: some examples (like the halting shift-overflow counters below) use a counter on one side and a bouncer (sometimes called unary counter) on the other.

Examples

Halting shift-overflow counters:

Related links