Cycler: Difference between revisions
Jump to navigation
Jump to search
(Used Template:Stub) |
(Mentioned BBS and BBP) |
||
| Line 5: | Line 5: | ||
'''û''' → '''û''' | '''û''' → '''û''' | ||
where '''û''' is any headed tape segment. | where '''û''' is any headed tape segment. | ||
==Related Functions== | |||
* Busy Preperiodic Beaver ([[BBS]](n,m)): The longest possible preperiod of a cycler or translated cycler with n states and m symbols. | |||
* Busy Periodic Beaver ([[BBP]](n,m)): The longest possible period of a cycler or translated cycler with n states and m symbols. | |||
== See also == | == See also == | ||
Latest revision as of 11:01, 17 August 2025
1RB0LB_1LB1LC_0RC1RA (bbch), which has period 18 and preperiod 4.A cycler is a Turing machine that eventually enters a repeating cycle. Such a Turing machine runs forever and thus is a non-halting Turing machine. A cycler may be seen as a special case of a translated cycler which has offset zero.
The rule for identifying cyclers is simple:
û → û
where û is any headed tape segment.
Related Functions
- Busy Preperiodic Beaver (BBS(n,m)): The longest possible preperiod of a cycler or translated cycler with n states and m symbols.
- Busy Periodic Beaver (BBP(n,m)): The longest possible period of a cycler or translated cycler with n states and m symbols.
See also
- Translated cycler
- Section 2 of bbchallenge's deciders write-up.