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 <vb9p4s$3s1jn$1@dont-email.me>
Deutsch   English   Français   Italiano  
<vb9p4s$3s1jn$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: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Defining a correct halt decider
Date: Wed, 4 Sep 2024 08:59:55 -0500
Organization: A noiseless patient Spider
Lines: 83
Message-ID: <vb9p4s$3s1jn$1@dont-email.me>
References: <vb4npj$1kg8k$1@dont-email.me> <vb6i8p$39fhi$1@dont-email.me>
 <vb72a4$3b4ub$6@dont-email.me> <vb9c4j$3psb3$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 04 Sep 2024 15:59:57 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="dd43bdf9b61f877c9b4c44ca800456cb";
	logging-data="4064887"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19A11LKuHqa4lK8DkcRHAXG"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:RqhxaGCcogy/NLeNFId+JpY8Jck=
Content-Language: en-US
In-Reply-To: <vb9c4j$3psb3$3@dont-email.me>
Bytes: 4469

On 9/4/2024 5:17 AM, Fred. Zwarts wrote:
> Op 03.sep.2024 om 15:17 schreef olcott:
>> On 9/3/2024 3:44 AM, Mikko wrote:
>>> On 2024-09-02 16:06:11 +0000, olcott said:
>>>
>>>> A correct halt decider is a Turing machine T with one accept state 
>>>> and one reject state such that:
>>>>
>>>> If T is executed with initial tape contents equal to an encoding of 
>>>> Turing machine X and its initial tape contents Y, and execution of a 
>>>> real machine X with initial tape contents Y eventually halts, the 
>>>> execution of T eventually ends up in the accept state and then stops.
>>>>
>>>> If T is executed with initial tape contents equal to an encoding of 
>>>> Turing machine X and its initial tape contents Y, and execution of a 
>>>> real machine X with initial tape contents Y does not eventually 
>>>> halt, the execution of T eventually ends up in the reject state and 
>>>> then stops.
>>>
>>> Your "definition" fails to specify "encoding". There is no standard
>>> encoding of Turing machines and tape contents.
>>>
>>
>> That is why I made the isomorphic x86utm system.
>> By failing to have such a concrete system all kinds
>> of false assumptions cannot be refuted.
>>
>> The behavior of DDD emulated by HHH** <is> different
>> than the behavior of the directly executed DDD**
>> **according to the semantics of the x86 language
>>
>> HHH is required to report on the behavior tat its finite
>> string input specifies even when this requires HHH
>> to emulate itself emulating DDD.
>>
>> DDD never halts unless it reaches its own final
>> halt state. The fact that the executed HHH halts
>> has nothing to do with this.
>>
>> HHH is not allowed to report on the computation that
>> itself is contained within.
> 
> But it must be able to process a finite string containing a copy of 
> itself, or containing a similar algorithm.
> 
>>
>> Except for the case of pathological self-reference the
>> behavior of the directly executed machine M is always
>> the same as the correctly simulated finite string ⟨M⟩.
> 
> There is no self-reference, 

It is very stupid to say that when this proves there is
https://github.com/plolcott/x86utm/blob/master/Halt7out.txt

> except in olcott's crippled example, where 
> he places the code of the simulating HHH inside the finite string of its 
> input.
> The finite string containing the description of DDD and all functions 
> called by it including HHH) should not be placed in the same memory 
> location as the simulator's code and variables.
> 
>>
>> That no one has noticed that they can differ does not
>> create an axiom where they are not allowed to differ.
> 
> By twisting the code and the examples in such ways that the simulation 
> is crippled, you do not prove that they show anything useful.
> 
>>
>> No one noticed that they differ only because everyone
>> rejected the idea of a simulating halt decider out-of-hand
>> without review.
>>
> Olcott is a strange person. At the one hand he is begging for reviews, 
> but he is so arrogant that he does not want to learn anything from the 
> reviews. He has such a strong belief in his ideas, that he thinks that 
> reviewers are lying if the prove that he is incorrect.


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