Irregular Turing Machine: Difference between revisions
Jump to navigation
Jump to search
(Created page for irregular TMs) |
(No difference)
|
Revision as of 12:33, 31 August 2025
A Turing machine is irregular if it cannot be decided using CTL (regular language methods).
Notable examples
1RB1RE_1LC1RB_0RA0LD_1LB1LD_---0RA(bbch), also called Finned #3.