Irregular Turing Machine

From BusyBeaverWiki

Revision as of 18:42, 4 December 2025 by Polygon (talk | contribs) (→Notable examples: added skelet 17)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

This article is a stub. You can help the BusyBeaverWiki by expanding it.

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.
1RB---_0LC1RE_0LD1LC_1RA1LB_0RB0RA (bbch), also called Skelet 17.

Retrieved from "https://wiki.bbchallenge.org/w/index.php?title=Irregular_Turing_Machine&oldid=5336"