machine that always halts
添加释义
Machine that always halts
-
abstract:
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.
以上来源于:
WordNet