Irregular Turing Machine

From BusyBeaverWiki
Revision as of 12:33, 31 August 2025 by Polygon (talk | contribs) (Created page for irregular TMs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A Turing machine is irregular if it cannot be decided using CTL (regular language methods).

Notable examples