Bouncer

From BusyBeaverWiki
Revision as of 03:52, 10 November 2024 by Icy (talk | contribs)
Jump to navigation Jump to search
1RB0LB_1LA0RA
A close-up of the bouncer 1RB0LB_1LA0RA (bbch) with 2 states, the smallest number of states for which a bouncer can appear.

A bouncer is a Turing machine whose tape head, roughly speaking, alternates back and forth between the two edges of the tape in a linear fasion, growing the tape along one or both edges. A bouncer is a possible classification of non-halting Turing machines.