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 <vg8fm9$fg4n$2@dont-email.me>
Deutsch   English   Français   Italiano  
<vg8fm9$fg4n$2@dont-email.me>

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

Path: news.eternal-september.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: The philosophy of computation reformulates existing ideas on a
 new basis --- getting somewhere
Date: Sun, 3 Nov 2024 12:33:44 -0600
Organization: A noiseless patient Spider
Lines: 73
Message-ID: <vg8fm9$fg4n$2@dont-email.me>
References: <vfli1h$fj8s$1@dont-email.me> <vflue8$3nvp8$2@i2pn2.org>
 <vfmd8m$k2m7$1@dont-email.me>
 <bcd82d9f8a987d3884220c0df7b8f7204cb9de3e@i2pn2.org>
 <vfmueh$mqn9$1@dont-email.me>
 <ff039b922cabbb6d44f90aa71a52d8c2f446b6ab@i2pn2.org>
 <vfo95k$11qs1$1@dont-email.me> <vfp8c0$3tobi$2@i2pn2.org>
 <vfpbtq$1837o$2@dont-email.me> <vfq4h9$1fo1n$1@dont-email.me>
 <vfqrro$1jg6i$1@dont-email.me> <vfvnbk$2lj5i$1@dont-email.me>
 <vfvudo$2mcse$5@dont-email.me> <vg2c7p$379h1$1@dont-email.me>
 <vg2hei$37lpn$8@dont-email.me> <vg5030$3oo1p$1@dont-email.me>
 <vg56vn$3pnvp$2@dont-email.me> <vg7pab$bqa3$1@dont-email.me>
 <vg81v7$d0a1$2@dont-email.me>
 <f2a8c9b592f68732a079819dde95e29d6a1fd50c@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 03 Nov 2024 19:33:45 +0100 (CET)
Injection-Info: dont-email.me; posting-host="78d696b0e880e7e96a4aa9625f760657";
	logging-data="508055"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19++93zImw8Hg7sTdqBvzQ9"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:u0ti1Z3huD9nk9WBT+BBPqD9+O8=
X-Antivirus-Status: Clean
In-Reply-To: <f2a8c9b592f68732a079819dde95e29d6a1fd50c@i2pn2.org>
X-Antivirus: Norton (VPS 241102-0, 11/1/2024), Outbound message
Content-Language: en-US

On 11/3/2024 12:20 PM, Richard Damon wrote:
> On 11/3/24 9:39 AM, olcott wrote:
>>
>> That is why I used to fully defined semantics of the x86
>> language to make this 100% perfectly unequivocal.
>>
>> A few lines of x86 code express complex algorithms
>> succinctly enough that human minds are not totally
>> overwhelmed by far too much tedious detail.
>>
>>> It is not pspecified
>>> in the usual formulation of the problem. Also note that
>>> the behaviour exists before those strings so "describe"
>>> should be and usually is used instead of "specify". The
>>> use of latter may give the false impression that the behaviour
>>> is determined by those strings.
>>>
>>
>> In order for any machine to compute the mapping from
>> a finite string it must to so entirely on the basis
>> of the actual finite string and its specified semantics.
> 
> You have that somewhat backwards. It *CAN* only do what it can compute.
> 
> The mapping is not required to *BE* computable.
> 
>>
>> The finite string input to HHH specifies that HHH
>> MUST EMULATE ITSELF emulating DDD.
> 
> Right, and it must CORRECTLY determine what an unbounded emulation of 
> that input would do, even if its own programming only lets it emulate a 
> part of that.
> 

Yes this is exactly correct. I don't understand
why you keep disagreeing with your own self this.

>>
>> The finite string input to HHH1 specifies that HHH1
>> MUST NOT EMULATE ITSELF emulating DDD.
> 
> But the semantics of the string haven't changed, as the string needs to 
> contain all the details of how the machine it is looking at will work.
> 

DDD emulated by HHH specifies that HHH will
emulate itself emulating DDD.

DDD emulated by HHH1 specifies that HHH1 will
NOT emulate itself emulating DDD.

>>
>> Unless HHH rejects its input DDD as non halting the
>> executed DDD never stops running. This itself proves
>> that HHH is correct and that DDD is not the same
>> instance as the one that HHH rejected.
> 
> You have cause and effect backwards.
> 

<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
     If simulating halt decider H correctly simulates its input D
     until H correctly determines that its simulated D would never
     stop running unless aborted then...

The conditional branch instruction criteria has been met.



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