Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 22. May 2025, 16:37:31
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100ngbr$3hg1k$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
User-Agent : Mozilla Thunderbird
On 5/22/2025 1:52 AM, joes wrote:
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.
Yet no one ever bothers to notice that
this counter-example input cannot possibly
actually do the opposite of whatever value
that its decider returns.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer