On 20/08/2025 03:14, Richard Heathfield wrote:
On 20/08/2025 03:09, olcott wrote:
The halting problem proofs depend on the assumption
that there is an H/D pair such that D is undecidable by H.
No, they depend on the assumption that D /is/ decidable by H, for
all D. They then show that the assumption must be false.
Mr Olcott never replied to the above (as far as I can tell, anyway).
And it's a shame, because I think it strikes at the heart of his misunderstanding about HP proofs.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)