Irregular Turing Machine

From BusyBeaverWiki

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.

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