Some proofs of this statement rely on the same contradiction inherent in the barber paradox. The firstproof of this statement adapted Cantor's diagonalization proof. Chaitin's omega constant gives a probabilityfor this statement. If this statement were true, then every recursively enumerable language would berecursive. This statement can be used to prove, by reduction, Rice's theorem. This statement is required tobe true for busy beavers. Because this statement is usually cumbersome to work with, it is typically reducedto Post's correspondence problem instead. For 10 points, name this undecidable decision problem that asksif a given program w
Some proofs of this statement rely on the same contradiction inherent in the barber paradox. The firstproof of this statement adapted Cantor's diagonalization proof. Chaitin's omega constant gives a probabilityfor this statement. If this statement were true, then every recursively enumerable language would berecursive. This statement can be used to prove, by reduction, Rice's theorem. This statement is required tobe true for busy beavers. Because this statement is usually cumbersome to work with, it is typically reducedto Post's correspondence problem instead. For 10 points, name this undecidable decision problem that asksif a given program will finish running.
Some proofs of this statement rely on the same contradiction inherent in the barber paradox.
halting problem [or halting theorem; or obvious equivalents, such as whether a program will halt or not before "will finish running" is read]