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 <v3abb8$1paor$2@dont-email.me>
Deutsch   English   Français   Italiano  
<v3abb8$1paor$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,sci.logic
Subject: Re: D correctly simulated by H cannot possibly halt --- templates and
 infinite sets --- deciders
Date: Thu, 30 May 2024 12:00:23 -0500
Organization: A noiseless patient Spider
Lines: 46
Message-ID: <v3abb8$1paor$2@dont-email.me>
References: <v3501h$lpnh$1@dont-email.me> <v3a3a3$1nupq$1@dont-email.me>
 <v3a5fc$1o4q1$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 30 May 2024 19:00:24 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="0a722b73a14c6c7bef786c05822a9348";
	logging-data="1878811"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+0DVKc6Xo827CMBRlSKsUL"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:hId2SfBMhEPW3PeUMcqZNtwZEyM=
Content-Language: en-US
In-Reply-To: <v3a5fc$1o4q1$2@dont-email.me>
Bytes: 2897

On 5/30/2024 10:20 AM, Fred. Zwarts wrote:
> Op 30.mei.2024 om 16:43 schreef olcott:
>> On 5/28/2024 11:16 AM, olcott wrote:
>>>
>>> When Ĥ is applied to ⟨Ĥ⟩
>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>
>>> *Formalizing the Linz Proof structure*
>>> ∃H  ∈ Turing_Machines
>>> ∀x  ∈ Turing_Machines_Descriptions
>>> ∀y  ∈ Finite_Strings
>>> such that H(x,y) = Halts(x,y)
>>>
>>
>> A decider computes the mapping from finite string inputs to
>> its own accept or reject state.
>>
>> A decider does not and cannot compute the mapping from
>> Turing_Machine inputs to its own accept or reject state.
>>
>> Halts(x,y) would report on the direct execution of x(y) thus ignores
>> the pathological behavior of x correctly simulated by pure function H.
>> This makes Halts(x,y) an incorrect measure of the correctness of H(x,y).
> 
> Why are you referring to the 'pathological behavior of x' if your claim 
> is that the simulator does not even reach the part of DD (below) that 
> contradicts the result of HH? This 'pathological behavior of x' is 
> completely irrelevant. 

It is totally relevant because it is the reason why D correctly
simulated by H cannot possibly halt.

> The problem is that a simulating decider is 
> unable to handle the simulation of itself because it gets stuck in 
> recursive simulation). That DD contradicts HH's result is completely 
> irrelevant.
> 

The simulating decider does not get stuck in recursive simulation
it detects the repeating state of D and stops simulating.

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