Sujet : Re: Who here understands that the last paragraph is Necessarily true? --- Self-Modifying Turing Machine
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 21. Jul 2024, 14:58:56
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v7j470$3o7r$5@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
User-Agent : Mozilla Thunderbird
On 7/21/2024 4:52 AM, Mikko wrote:
On 2024-07-20 13:03:50 +0000, olcott said:
On 7/20/2024 4:01 AM, Mikko wrote:
On 2024-07-19 14:18:05 +0000, olcott said:
>
When a Self-Modifying Turing Machine can change itself to become
any other Turing Machine then it can eliminate the pathological
relationship to its input.
>
It never was a Turing machine.
>
>
A self modifying TM is merely a TM description that is
simulated by a UTM and has access to itself on the UTM
tape.
No, it is not.
I invented it thus that is the specification of my invention.
A TM description describes a TM that does not change itself.
X is not typically understood to do Y therefore it is
impossible for X to do Y is incorrect reasoning.
If it is executed as self-modifying that exectuion is not simulation, as
a simulation does not do what the simulated does not do. A simulator that
simulates a self-modifying automaton is not an UTM.
That you fail to understand that an emulated x86 program can
modify itself to change its own behavior as long as it knows
its own machine address is merely ignorance on your part.
When a simulated Turing Machine Description is provided
access to itself on the UTM tape it can do the same thing.
Rigid minded people incorrectly conflate unconventional
for impossible.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…