Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <v36ra1$12u78$1@dont-email.me>
Deutsch   English   Français   Italiano  
<v36ra1$12u78$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: Every D(D) simulated by H presents non-halting behavior to H ###
Date: Wed, 29 May 2024 12:08:17 +0300
Organization: -
Lines: 73
Message-ID: <v36ra1$12u78$1@dont-email.me>
References: <v18e32$1vbql$1@dont-email.me> <v1vc8j$3jmr$1@dont-email.me> <v1vsru$7eqc$1@dont-email.me> <v21r4i$otc2$2@dont-email.me> <v22k4b$umr4$1@dont-email.me> <v24oah$1h4u3$1@dont-email.me> <v256fc$1kais$1@dont-email.me> <v27d05$25ga0$1@dont-email.me> <v2838r$29rd7$1@dont-email.me> <v2a8th$2ps09$1@dont-email.me> <v2ahqc$2qvr9$1@dont-email.me> <v2cb5s$39fvg$1@dont-email.me> <v2crk0$3cifp$1@dont-email.me> <v2cvuo$3dfkm$1@dont-email.me> <v2i921$jvcs$5@dont-email.me> <v2k7fe$12vjm$1@dont-email.me> <v2l0q8$17mu1$1@dont-email.me> <v2n4f7$1ms87$1@dont-email.me> <v2nfma$1or9h$4@dont-email.me> <v2pkqq$28mg0$1@dont-email.me> <v2qhr2$2dpfr$6@dont-email.me> <v2s6kk$2q0pf$1@dont-email.me> <v2skde$2s65h$1@dont-email.me> <v2uthd$3bjch$1@dont-email.me> <v2vdkp$3dtct$3@dont-email.me> <v2vned$3fl3r$1@dont-email.me> <v2vp8f$3g0m3$1@dont-email.me> <v31f7s$3ukf5$1@dont-email.me> <v3236b$29pd$1@dont-email.me> <v340en$gbvn$1@dont-email.me> <v34q6t$krgu$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 29 May 2024 11:08:18 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="e07c76dd9bdfc08d0897ebfa08be038d";
	logging-data="1145064"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18E+UnXEFiQWetcPER5vP4c"
User-Agent: Unison/2.2
Cancel-Lock: sha1:0DoCqZOOHDbdlKimXYRI1+NSxSc=
Bytes: 4415

On 2024-05-28 14:37:15 +0000, olcott said:

> On 5/28/2024 2:17 AM, Mikko wrote:
>> On 2024-05-27 13:52:09 +0000, olcott said:
>> 
>>> On 5/27/2024 3:11 AM, Mikko wrote:
>>>> On 2024-05-26 16:50:21 +0000, olcott said:
>>>> 
>>> 
>>> <snip>
>>> So that: *Usenet Article Lookup*
>>> http://al.howardknight.net/
>>> can see the whole message now that
>>> *the Thai spammer killed Google Groups*
>>> 
>>> typedef int (*ptr)();  // ptr is pointer to int function in C
>>> 00       int H(ptr p, ptr i);
>>> 01       int D(ptr p)
>>> 02       {
>>> 03         int Halt_Status = H(p, p);
>>> 04         if (Halt_Status)
>>> 05           HERE: goto HERE;
>>> 06         return Halt_Status;
>>> 07       }
>>> 08
>>> 09       int main()
>>> 10       {
>>> 11         H(D,D);
>>> 12         return 0;
>>> 13       }
>>> 
>>>>> When we see that D correctly simulated by pure simulator H would remain
>>>>> stuck in recursive simulation then we also know that D never reaches its
>>>>> own line 06 and halts in less than an infinite number of correctly
>>>>> simulated steps.
>>>> 
>>>> Which means that H never terminates. You said that by your definition
>>>> a function that never terminates is not a pure function. Therefore
>>>> H, if it exists, is not a pure function, and the phrase "pure function
>>>> H" does not denote.
>>> 
>>> *I should have said that more clearly*
>>> *That is why I need reviewers*
>> 
>> What is said here has little significance. You should ask reviewer's
>> comments about your working draft that you maintain in GitHub or some
>> other web site. And you should update that draft when a reviewer finds
>> some something wrong or unclear.
>> 
>>> *This is STEP ONE of my four step proof*
>>> STEP TWO applies these same ideas to the Peter Linz HP proof.
>>> STEP THREE shows how the Linz Ĥ.H sees the behavior of its recursive
>>>       simulations.
>>> STEP FOUR shows why the behavior of the INPUT is the correct basis.
>> 
>> When discussing individual steps of a proof draft you shold start
>> at the last step.
> 
> I have been at this for twenty years.
> Ben Bacarisse has spoken with me for 15 of those years.
> 
> What I found out is that exactly one point of one step
> must be pursued until complete closure of that one point
> of that one step.

How long do you think it takes to cover them all, starting
from the first?

How long do you think it would take, starting from the last?

-- 
Mikko