Definitions for halting problem
halt·ing prob·lem

WiktionaryRate this definition:0.0 / 0 votes

1. halting problemnoun

   The problem of deciding in finite time whether any program will finish running in finite time, when given a certain finite input.

WikipediaRate this definition:0.0 / 0 votes

1. Halting problem

   In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program–input pairs cannot exist. For any program f that might determine whether programs halt, a "pathological" program g, called with some input, can pass its own source and its input to f and then specifically do the opposite of what f predicts g will do. No f can exist that handles this case. A key part of the proof is a mathematical definition of a computer and program, which is known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first cases of decision problems proven to be unsolvable. This proof is significant to practical computing efforts, defining a class of applications which no programming invention can possibly perform perfectly. Jack Copeland attributes the introduction of the term halting problem to the work of Martin Davis in the 1950s.

WikidataRate this definition:0.0 / 0 votes

1. Halting problem

   In computability theory, the halting problem can be stated as follows: "Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever". This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. A key part of the proof was a mathematical definition of a computer and program, what became known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first examples of a decision problem. Jack Copeland attributes the term halting problem to Martin Davis.

How to pronounce halting problem?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say halting problem in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of halting problem in Chaldean Numerology is: 8

2. Pythagorean Numerology

   The numerical value of halting problem in Pythagorean Numerology is: 8

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Halting_Problem
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Halting_Problem
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=halting problem