Am Wed, 21 May 2025 18:14:42 -0500 schrieb olcott:

All of the proofs ASSUME that there is an input D that can ACTUALLY DO
the opposite of whatever value that H returns making it impossible for H
to decide D.

No, the proof assumes there is a *decider* and then shows exactly *how*
to construct a counterexample.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)