Sujet : Re: Who here understands that the last paragraph is Necessarily true? --- Self-Modifying Turing Machine
De : agisaak (at) *nospam* gm.invalid (André G. Isaak)
Groupes : comp.theoryDate : 20. Jul 2024, 01:44:41
Autres entêtes
Organisation : Christians and Atheists United Against Creeping Agnosticism
Message-ID : <v7f19p$37c8h$1@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
User-Agent : Mozilla Thunderbird
On 2024-07-19 10:02, olcott wrote:
A Self-Modifying Turing Machine is defined as a Turing
Machine Description that has access to its own tape
location on the UTM that is simulating it.
Umm. Maybe explain how that's supposed to work...
A TM has no idea whether it is being run directly or being run in a UTM. And even if it is being run in a UTM, it certainly does NOT have access to the machine description which is present on the UTM's tape.
There's lots of examples of UTMs available on the web. Maybe you should actually try playing around with some of them so you can learn how actual UTMs work. Hint: It's not how you think.
André
-- To email remove 'invalid' & replace 'gm' with well known Google mail service.