Let H(P, n) be a program with two possible outcomes: TRUE and FALSE. The parameter P is a program and n is its input. Suppose that H(P, n) = TRUE
if and only if P halts on n. Suppose further that if H(P, n) = FALSE
then P does not halt on n, and suppose that H is sound. Let furthermore
P* be a program with itself as a parameter. The claim is that there
exists a program H such that H(H, H*) = FALSE, that is, H proves that it
does not prove that H* halts.
https://www.researchgate.net/publication/316562253_Getting_around_the_Halting_Problem
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 296 |
Nodes: | 16 (2 / 14) |
Uptime: | 76:49:38 |
Calls: | 6,657 |
Calls today: | 3 |
Files: | 12,203 |
Messages: | 5,332,821 |
Posted today: | 1 |