Irregular Turing Machine: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Turn URL into link
Line 5: Line 5:
All non-halting TMs in domains [[BB(2)]], [[BB(3)]], [[BB(4)]], [[BB(2,3)]] and [[BB(2,4)]] are regular. This was proven by deciding these domains completely using only regular deciders as described in the BB(5) paper.<ref>'''Determination of the fifth Busy Beaver value.''' The bbchallenge Collaboration et al. https://arxiv.org/abs/2509.12337</ref>
All non-halting TMs in domains [[BB(2)]], [[BB(3)]], [[BB(4)]], [[BB(2,3)]] and [[BB(2,4)]] are regular. This was proven by deciding these domains completely using only regular deciders as described in the BB(5) paper.<ref>'''Determination of the fifth Busy Beaver value.''' The bbchallenge Collaboration et al. https://arxiv.org/abs/2509.12337</ref>


[[BB(5)]] contains at least two irregular TMs. All BB(5) except for the 13 [[sporadic TMs]] are regular. Among the sporadic TMs:
[[BB(5)]] contains at least two irregular TMs. All BB(5) TMs except for the 30 (13 [[sporadic TMs]] and 17 proven by [[WFAR]]) are known regular. Among these remaining 30 TMs:


* Proven Regular: [[Skelet 1]]
* 1 Proven Regular: [[Skelet 1]]
* Proven Irregular: [[Finned 3]] by Iijil in 2023 and [[Skelet 17]] [TODO: add ref]
* 2 Proven Irregular: [[Finned 3]] by Iijil in 2023 and [[Skelet 17]] [TODO: add ref]
* Unknown regularity: [[Skelet 10]], 5 [[Shift overflow counter|Shift overflow counters]], other 4 finned TMs
* 27 Unknown regularity: [[Skelet 10]], 5 [[Shift overflow counter|Shift overflow counters]], other 4 finned TMs, and 17 proven by WFAR. According to Justin Blanchard, all of these are suspected of being irregular.<ref>https://discord.com/channels/960643023006490684/1295401870298320977/1337815008347951126</ref>


It seems that all [[Cryptids]] are irregular, but we are not aware of a written proof for any of them yet. If that is the case, then all domains bigger than [[BB(6)]], [[BB(2,5)]] and [[BB(3,3)]] contain irregular TMs.
It seems that all [[Cryptids]] are irregular, but we are not aware of a written proof for any of them yet. If that is the case, then all domains bigger than [[BB(6)]], [[BB(2,5)]] and [[BB(3,3)]] contain irregular TMs.

Revision as of 18:59, 1 October 2026

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]

Domains with Irregular TMs

All non-halting TMs in domains BB(2), BB(3), BB(4), BB(2,3) and BB(2,4) are regular. This was proven by deciding these domains completely using only regular deciders as described in the BB(5) paper.[2]

BB(5) contains at least two irregular TMs. All BB(5) TMs except for the 30 (13 sporadic TMs and 17 proven by WFAR) are known regular. Among these remaining 30 TMs:

It seems that all Cryptids are irregular, but we are not aware of a written proof for any of them yet. If that is the case, then all domains bigger than BB(6), BB(2,5) and BB(3,3) contain irregular TMs.

Notable examples

References