Sujet : Re: Self-Modifying Turing Machine
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 20. Jul 2024, 14:53:24
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <7c5ba657292ffe956b0dc7e1fb9ac565836b4758@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
User-Agent : Mozilla Thunderbird
On 7/20/24 9:40 AM, olcott wrote:
On 7/20/2024 8:24 AM, joes wrote:
Am Sat, 20 Jul 2024 08:03:50 -0500 schrieb olcott:
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.
This same idea can be implemented as an emulated x86 program that knows
its own machine address. Self-modifying code is not a new idea. Applying
this to TMs is a new idea.
This is your first mention of selfmodification.
>
*No eight years ago was mu first mention* August 2016
https://www.researchgate.net/publication/307509556_Self_Modifying_Turing_Machine_SMTM_Solution_to_the_Halting_Problem_concrete_example
(1) Every TM / input pair either halts or fails to halt.
(2) There exists a TM halt decider for every TM / input pair.
(3) A SMTM can become any element of the set of TMs.
(4) Therefore a SMTM can become a halt decider for any TM input pair.
A self modifying TM is merely a TM description of a machine that is
simulated by a UTM such that this TM description has access to its
location on the UTM tape.
It is isomorphic to an x86 program that knows its own machine
address within its x86 emulator.
Everyone here is acting like unconventional new ideas are impossible
because they are unconventional and new.
No, but you can't transfer conventional knowledge unchanged.
>
WHich is just bad logic from someone who doesn't understand what he is talking about.
You show your error by making a clear "type error" in your logic. You say a "self modifying TM is ... a TM description", but TMs are NOT their description (as you point out in your deceptive claim that a TM can not take a TM as an input).
ALL "self-modifying" programs can be converted to an equivalent version that doesn't use self-modification.
Also, yout (2) just shows your ignorance of the problem. OF COURSE we can find a TM that gives the correct answer about a specific TM/input given. We just need to choose between the machine that answers Halting always or non-halting always. The problem is to find ONE program that givens the answer for ALL input.
…