Sujet : Re: Turing computable functions --- EEE(III)
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 26. Mar 2025, 10:46:58
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <3dd145b60c1e8b3556a7ebca835e16b609a8033d@i2pn2.org>
References : 1 2 3 4 5
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
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).
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.
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.
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.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.
Turing computable functions
Re: Turing computable functions