Explore relationships

Decider (Turing machine)

In computability theory, a decider is a Turing machine that halts for every input. A decider is also called a total Turing machine as it represents a total function.

Use + to expand a branch. Click a topic name to open its summary.