Skip to main content
Code Golf

About

Ask Question
Tag Info
Info Newest Frequent Score Active Unanswered

For problems pertaining to the whether or not an automaton will halt.

The Halting Problem famously is incomputable for Turing complete automata. However the halting problem can be solved for automata of weaker computational class.

History Excerpt history