Irregular Turing Machine

From BusyBeaverWiki

Revision as of 13:02, 21 February 2026 by Polygon (talk | contribs) (Expanded (text taken from https://discord.com/channels/960643023006490684/960643023530762341/1357307689109028874))

(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 regular CTL, which means there is no regular language, closed under TM operations, that approximates the language of the machine and does not include any halting configuration.

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=6379"