Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: How the requirements that Professor Sipser agreed to are exactly
 met
Date: Tue, 13 May 2025 00:22:15 -0500
Organization: A noiseless patient Spider
Lines: 35
Message-ID: <vvuku8$1j6s0$7@dont-email.me>
References: <vvte01$14pca$29@dont-email.me> <vvte62$15ceh$18@dont-email.me>
 <vvtej1$181kg$1@dont-email.me> <vvtjj8$15ceh$19@dont-email.me>
 <vvtl1g$19cvp$1@dont-email.me> <vvtlmm$15ceh$20@dont-email.me>
 <vvto7c$1a1pf$1@dont-email.me> <vvtpqu$1agqu$1@dont-email.me>
 <vvtq8d$1a1pf$2@dont-email.me> <vvtqn1$1agqu$2@dont-email.me>
 <vvtsmf$1aube$1@dont-email.me> <vvtsq5$1agqu$3@dont-email.me>
 <vvttf7$1bfib$1@dont-email.me> <vvu008$1c062$1@dont-email.me>
 <vvu0mm$1c0vi$1@dont-email.me> <vvu0si$1c062$2@dont-email.me>
 <vvu1m8$1c86j$1@dont-email.me> <vvu2q2$1c062$3@dont-email.me>
 <vvu3ht$1c86j$3@dont-email.me> <vvu3lm$1c062$5@dont-email.me>
 <vvu42d$1cmbo$1@dont-email.me> <vvu46e$1c062$6@dont-email.me>
 <vvu5ch$1csst$1@dont-email.me> <vvu5j3$1c062$7@dont-email.me>
 <vvu5uk$1d27t$1@dont-email.me> <vvu88j$1c062$9@dont-email.me>
 <vvu95f$1deu5$1@dont-email.me> <vvuk9b$1k6qa$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 13 May 2025 07:22:17 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="43745e07502355f27fac5eed8a7d2487";
	logging-data="1678208"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19gz0aLUGIbE5W9y1txJSEY"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:e0BnSpxU+oJ6UEltGehx4Y7LGSA=
X-Antivirus-Status: Clean
In-Reply-To: <vvuk9b$1k6qa$1@dont-email.me>
X-Antivirus: Norton (VPS 250513-0, 5/12/2025), Outbound message
Content-Language: en-US

On 5/13/2025 12:11 AM, Richard Heathfield wrote:
> On 13/05/2025 03:01, olcott wrote:
>> If the Goldbach conjecture is true (and there is
>> no short-cut)
> 
> We don't know that. Fermat's Last Theorem had a short cut, but it took 
> 358 years to find it. At that rate, we won't find Goldbach's short cut 
> (if it has one) for another 75 years.
> 
>> this requires testing against every
>> element of the set of natural numbers an infinite
>> computation.
> 
> Only if it's true. So if it's true, the testing program will never halt. 
> But if it's false, the tester will eventually find the counter-example, 
> print it, and stop.
> 
> So a program that can tell whether another program will halt can tell us 
> whether Goldbach's conjecture is true.
> 
> It would be the short cut that you say doesn't exist.
> 

I am refuting the key halting problem, proof
I am not refuting the halting problem.

As soon as it is understood that I am correct
that HHH(DD) computes the mapping from its
input to recursive emulation. Then in a few small
steps it will be know that I refuted the conventional
Halting Problem proofs.

-- 
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer