Re: Turing computable functions --- EEE(III)

Liste des GroupesRevenir à theory 
Sujet : Re: Turing computable functions --- EEE(III)
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 26. Mar 2025, 17:18:08
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vs19c1$2346o$1@dont-email.me>
References : 1 2 3 4 5 6
User-Agent : Mozilla Thunderbird
On 3/26/2025 4:46 AM, joes wrote:
Am Tue, 25 Mar 2025 22:17:06 -0500 schrieb olcott:
On 3/25/2025 5:48 PM, Richard Damon wrote:
On 3/25/25 6:07 PM, olcott wrote:
On 3/25/2025 4:16 PM, joes wrote:
Am Tue, 25 Mar 2025 14:24:07 -0500 schrieb olcott:
 
When an input finite string specifies a pathological relationship
with its simulating halt decider the actual behavior that
pathological relationship derives must be reported because THAT IS
THE BEHAVIOR THAT IS SPECIFIED BY THIS INPUT FINITE STRING.
The relationship doesn't derive anything.
It is a tautology that a simulator reports what it reports. That
doesn't make that correct.
EEE emulates a finite number of steps EEE including EEE emulating
itself emulating III a finite number of times.

A partial simulation is not a complete simulation (non-halting
simulations are infinite).
It is stupid to define a simulating termination that
cannot report non-terminating inputs. Simulating
termination analyzers recognize non-terminating
behavior patterns in a finite number of steps.

III has different behavior when emulated by any EEE than when it is
emulated by any other emulator.
When III is emulated by EEE it never reaches its final halt state.
When III is emulated by any other emulator it ALWAYS reaches its final
halt state.
ALWAYS is the opposite of NEVER.

Sure looks like EEE is faulty here.
 
It might if you are totally clueless about the x86 language.

Since you defined that EEE wasn't a UTM, its result is allowed to be
subjective.
The same thing works for UTMs too yet they do not have such a concise
fully specified language where we can directly see every micro-step of
the algorithm.
>
The behavior of III is, and always is, the behavior of its direct
execution or the complete emulation of it by a REAL UTM, which for ALL
You have already said that there is no complete emulation.
Of any non-terminating input.

Yes, that's the problem.
 
your EEEs that only emulate a finite number of steps and then return
will always be to HALT.
It is the III emulated by the EEEs that never halt.
>
Note, none of those EEE ever showed the ACTUAL behavior of their input,
as that is BY DEFINITION, the behavior of that emulation by the UTM.
The behavior of III is
   [00002172]  [00002173]  [00002175]  [0000217a]...
No, III has no loop. You are confusing different simulation levels.
 
I have used the term recursive emulation
hundreds of times, did you notice that I
ever said it at least once?
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
25 Mar 25 * Turing computable functions39olcott
25 Mar 25 +* Re: Turing computable functions13dbush
25 Mar 25 i`* Re: Turing computable functions12olcott
25 Mar 25 i +* Re: Turing computable functions10dbush
25 Mar 25 i i`* Re: Turing computable functions9olcott
25 Mar 25 i i +* Re: Turing computable functions4dbush
25 Mar 25 i i i`* Re: Turing computable functions3olcott
25 Mar 25 i i i +- Re: Turing computable functions1Richard Damon
26 Mar 25 i i i `- Re: Turing computable functions1joes
25 Mar 25 i i +* Re: Turing computable functions3joes
25 Mar 25 i i i`* Re: Turing computable functions2olcott
25 Mar 25 i i i `- Re: Turing computable functions1Richard Damon
25 Mar 25 i i `- Re: Turing computable functions1Richard Damon
25 Mar 25 i `- Re: Turing computable functions1Richard Damon
25 Mar 25 +* Re: Turing computable functions11joes
25 Mar 25 i`* Re: Turing computable functions --- EEE(III)10olcott
25 Mar 25 i +* Re: Turing computable functions --- EEE(III)8Richard Damon
26 Mar 25 i i`* Re: Turing computable functions --- EEE(III)7olcott
26 Mar 25 i i +* Re: Turing computable functions --- EEE(III)3joes
26 Mar 25 i i i`* Re: Turing computable functions --- EEE(III)2olcott
27 Mar 25 i i i `- Re: Turing computable functions --- EEE(III)1Richard Damon
26 Mar 25 i i `* Re: Turing computable functions --- EEE(III)3Richard Damon
26 Mar 25 i i  `* Re: Turing computable functions --- EEE(III)2olcott
27 Mar 25 i i   `- Re: Turing computable functions --- EEE(III)1Richard Damon
26 Mar 25 i `- Re: Turing computable functions --- EEE(III)1Fred. Zwarts
25 Mar 25 +- Re: Turing computable functions1Richard Damon
26 Mar 25 +* Re: Turing computable functions12Mikko
26 Mar 25 i`* Re: Turing computable functions11olcott
27 Mar 25 i +- Re: Turing computable functions1Richard Damon
27 Mar 25 i +* Re: Turing computable functions3Mikko
27 Mar 25 i i`* Re: Turing computable functions2olcott
28 Mar 25 i i `- Re: Turing computable functions1Mikko
27 Mar 25 i `* Re: Turing computable functions6Fred. Zwarts
27 Mar 25 i  `* Re: Turing computable functions5olcott
27 Mar 25 i   +* Re: Turing computable functions3Fred. Zwarts
28 Mar 25 i   i`* Re: Turing computable functions2olcott
28 Mar 25 i   i `- Re: Turing computable functions1Richard Damon
28 Mar 25 i   `- Re: Turing computable functions1Richard Damon
26 Mar 25 `- Re: Turing computable functions1Fred. Zwarts

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal