Sujet : Re: Who here understands that the last paragraph is Necessarily true? --- Self-Modifying Turing Machine
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 21. Jul 2024, 19:33:51
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <310f7cfeb4a3cbfe835f33ea5876ddbaa5324866@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 : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sun, 21 Jul 2024 08:58:56 -0500 schrieb olcott:
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:
A self modifying TM is merely a TM description that is simulated by a
UTM and has access to itself on the UTM tape.
Please explain how the two machines don't overwrite each other.
Or how the simulated one manages to break out and change the "UTM".
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.
When a simulated Turing Machine Description is provided access to itself
on the UTM tape it can do the same thing.
The description on the tape is not running. It can't have access to its
own hardware.
-- 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.
…