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 <ve1pa5$1s2mq$2@dont-email.me>
Deutsch   English   Français   Italiano  
<ve1pa5$1s2mq$2@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: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Simulating Termination Analyzer HHH(DDD) rejects input DDD
Date: Mon, 7 Oct 2024 18:02:29 -0500
Organization: A noiseless patient Spider
Lines: 53
Message-ID: <ve1pa5$1s2mq$2@dont-email.me>
References: <ve1gbe$1r7s8$1@dont-email.me>
 <d25865600e71696fdb84e56ad45fd41a6121331c@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 08 Oct 2024 01:02:30 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="369876f7fbf3669ecd1d4217493c4943";
	logging-data="1968858"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18nfhLck0er9Kg/4xI+h/b1"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:qsyIR2x5X0qC5qdNPpoc8HNybCs=
In-Reply-To: <d25865600e71696fdb84e56ad45fd41a6121331c@i2pn2.org>
Content-Language: en-US
Bytes: 2996

On 10/7/2024 5:39 PM, Richard Damon wrote:
> On 10/7/24 4:29 PM, olcott wrote:
>> *Simulating Termination Analyzer HHH(DDD) rejects input DDD*
>> HHH is an emulating termination analyzer that takes the machine
>> address of DDD as input then emulates the x86 machine language
>> of DDD until a non-terminating behavior pattern is recognized.
>>
> Except their can't be a non-terminating pattern in DDD if that happens, 
> as DDD is terminating.
> 
>> *HHH recognizes this pattern when HHH emulates itself emulating DDD*
>>
> 
> And is wrong for doing so, as HHH by return PROVES that DDD will terminate.
> 
>> void DDD()
>> {
>>    HHH(DDD);
>>    return;
>> }
>>
>> Terminating is a property of finite string machine descriptions.
>> One cannot simply ignore the actual behavior specified by the
>> finite string such that
> 
> And, for the PROGRAM DDD, must include the FULL decription  of the HHH 
> that it calls.
> 
> Thus, if that is all of the input, you are just proving that you have 
> been lying about working on the Halting problem, as your input ISN'T a 
> sufficient representation of the input.
> 
> Thus, your are whole problem is on a false basis.
> 
>>
>> DDD emulated by each corresponding HHH that can possibly
>> exist never returns.
> 
> No, the Emulation of DDD by each corresponding HHH doesn't reach a final 
> state, but the actual program DDD will return if the HHH it calls aborts 
> it simulation are returns 0.
> 

The finite string input to HHH specifies non-halting behavior.
This is simply over your head.

Not because you are not intelligent or educated enough to understand it.
It is because you are so sure that I must be wrong that all of your 
thinking has been boxed in by this false assumption.

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