Sujet : Re: ChatGPT totally understands exactly how I refuted the conventional halting problem proof technique
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 24. Jun 2025, 18:57:47
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <995bace8fe29b576c0d9410f991981143fd20046@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 24 Jun 2025 12:46:01 -0500 schrieb olcott:
It is an easily verified fact that no *input* to any partial halt
decider (PHD) can possibly do the opposite of what its corresponding PHD
decides. In all of the years of all of these proofs no such *input* was
ever presented.
You should clarify that you don't even think programs can be passed as
input.
-- 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.
…