Halting problem undecidability

Home > Philosophy > Deconstruction > Undecidability > Halting problem undecidability

It is a type of undecidability related to the problem of determining whether a given computer program will stop or run forever. This problem was first proposed by Alan Turing.