Difference between revisions of "Machine that always halts"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(Created page with "In computability theory, a '''machine that always halts''' — also called a '''decider''' (Sipser, 1996) or a '''total Turing machine''' (Kozen, 1997) — is a Turing m...")
 
Line 25: Line 25:
 
[[Category:Computing]]
 
[[Category:Computing]]
 
[[Category:Recursion]]
 
[[Category:Recursion]]
[[Category:Turing machine]]
+
[[Category:Turing machines]]

Revision as of 06:50, 20 September 2016

In computability theory, a machine that always halts — also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) — is a Turing machine that halts for every input.

Description

Because it always halts, the machine is able to decide whether a given string is a member of a formal language.

The class of languages which can be decided by such machines is exactly the set of recursive languages.

However, due to the Halting problem, determining whether an arbitrary Turing machine halts on every input is itself an undecidable decision problem.

See also

External links