This post is mostly for the benefit of Richard Damon who likes to play
word games.
The primary halting problem theorem proof [Turing, 1936] (upon which
other currently extant halting problem proofs are derived) is invalid
due to an invalid "impossible program" [Strachey, 1965] that arises not
from a function call-like infinite recursion but from a category error
in the form of an invalid (erroneous) infinite recursion present in the
proof [Wikipedia, 2022].
The categories involved in the category error are the decider and that
which is being decided. Currently extant attempts to conflate the
decider with that which is being decided are infinitely recursive and
thus invalid.
/Flibble
olcott <polcott2@gmail.com> writes:
On 5/5/2022 2:56 PM, Ben wrote:
olcott <polcott2@gmail.com> writes:
Proof of this is that the halting theorem has the exactly sameSo finally you agree that no single TM can decide TM halting??? How
self-contradictory pattern as the Liar Paradox.
For any program f that might determine if 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.
https://en.wikipedia.org/wiki/Halting_problem
long has it taken you to get to this point?
H1(P,P)==true is empirically proven to be correct
H(P,P)==false is empirically proven to be correct
You keep trying to get away with a halt decider that computes the
mapping from non-inputs even when you know this is incorrect.
Any conclusion I can form this is unkind. You are either dishonest and
are intentionally misrepresenting what other people write, or you are so
lost that even after 18 years you don't know what that halting problem
is.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 366 |
Nodes: | 16 (2 / 14) |
Uptime: | 04:05:18 |
Calls: | 7,812 |
Files: | 12,924 |
Messages: | 5,749,468 |