Irregular Turing Machine

From BusyBeaverWiki
Revision as of 18:31, 21 September 2026 by Sligocki (talk | contribs) (Clarify definition)
Jump to navigation Jump to search

A Turing machine is irregular if it cannot be decided using regular CTL, which means there is no regular language, closed under TM step, that includes the initial config and excludes all halting configurations.[1]

Notable examples

References