Re: Who here understands that the last paragraph is Necessarily true? --- Self-Modifying Turing Machine

On 7/19/24 9:10 PM, olcott wrote:

On 7/19/2024 7:44 PM, André G. Isaak wrote:

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.
>

 A self-modifying TM knows that it is only simulated by a UTM
and knows where it is located on the UTM tape.
 

But the UTM doesn't expost the discription of the Turing Machine to the Turing Machine it is emulating.
It CAN'T, and be a UTM, as a UTM needs to EXACTLY reproduce the behavior of the machine desceribed on its tape, and that machine doesn't have its description anywhere on the tape it can access.
You are just showing your utter ignorance of what you are talking about.
You can sort of imagine it is like a pure "Harvard Architecture" computer where the code space is in an entirely different memory space to the data space, and the processor can't write to the code space.

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é
>