halting problem

H h

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of halting problem words

noun Technical meaning of halting problem The problem of determining in advance whether a particular program or algorithm will terminate or run forever. The halting problem is the canonical example of a provably unsolvable problem. Obviously any attempt to answer the question by actually executing the algorithm or simulating each step of its execution will only give an answer if the algorithm under consideration does terminate, otherwise the algorithm attempting to answer the question will itself run forever. Some special cases of the halting problem are partially solvable given sufficient resources. For example, if it is possible to record the complete state of the execution of the algorithm at each step and the current state is ever identical to some previous state then the algorithm is in a loop. This might require an arbitrary amount of storage however. Alternatively, if there are at most N possible different states then the algorithm can run for at most N steps without looping. A program analysis called termination analysis attempts to answer this question for limited kinds of input algorithm. 1
noun halting problem (computer science) The problem of deciding in finite time whether any program will finish running in finite time, when given a certain finite input. 0

See all 2 definitions of halting problem

Information block about the term

Parts of speech for Halting problem

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Halting problem

See also

All definitions of halting problem

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?