Cycler: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[File:1RB0LB 1LB1LC 0RC1RA.png|alt=1RB0LB_1LB1LC_0RC1RA|thumb|upright=1.5|The record 3-state 2-symbol cycler {{TM|1RB0LB_1LB1LC_0RC1RA}}, which has period 18 and preperiod 4.]] | [[File:1RB0LB 1LB1LC 0RC1RA.png|alt=1RB0LB_1LB1LC_0RC1RA|thumb|upright=1.5|The record 3-state 2-symbol cycler {{TM|1RB0LB_1LB1LC_0RC1RA}}, 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, so is a [[ | A '''cycler''' is a Turing machine that eventually enters a repeating cycle. Such a Turing machine runs forever, so 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: | The rule for identifying cyclers is simple: | ||
Revision as of 03:45, 10 November 2024
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, so 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.