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, 19:46:10
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100nrdj$3jplm$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 21 22 23 24 25 26 27 28 29
User-Agent : Mozilla Thunderbird
On 5/22/2025 1:33 PM, Richard Heathfield wrote:
On 22/05/2025 19:16, olcott wrote:
<snip>
In other words you are too scatterbrained to keep
focused on a single point until closure is achieved.
Closure happened in 1936.
*CLOSURE ON THIS POINT HAS NEVER BEEN ACHIEVED*
When you try to define an input D to simulating termination
analyzer H that actually does the opposite of whatever value
that H returns you find that this
KEY ELEMENT OF THE CONVENTIONAL HALTING
PROBLEM PROOFS CANNOT POSSIBLY EXIST.
Define an input D to simulating termination analyzer H
that actually does the opposite of whatever value that
H returns.
*IT IS NEVER THE CASE THAT AN ACTUAL INPUT CAN DO THIS*
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer