Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Self-Modifying Turing Machine
Date: Sat, 20 Jul 2024 09:53:24 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <7c5ba657292ffe956b0dc7e1fb9ac565836b4758@i2pn2.org>
References: <v6un9t$3nufp$1@dont-email.me> <v7013v$2ccv$1@dont-email.me>
 <v70nt7$61d8$6@dont-email.me>
 <58fc6559638120b31e128fe97b5e955248afe218@i2pn2.org>
 <v71mjh$bp3i$1@dont-email.me>
 <1173a460ee95e0ca82c08abecdefc80ba86646ac@i2pn2.org>
 <v71okl$bvm2$1@dont-email.me>
 <5f6daf68f1b4ffac854d239282bc811b5b806659@i2pn2.org>
 <v71ttb$crk4$1@dont-email.me>
 <60e7a93cb8cec0afb68b3e40a0e82e9d63fa8e2a@i2pn2.org>
 <v721po$h4kr$1@dont-email.me> <v73td3$qkp2$6@dont-email.me>
 <v73tvs$qpi9$1@dont-email.me> <v74n81$13bn1$1@dont-email.me>
 <fafa57d75cf800c930c76530acd72148c77fff87@i2pn2.org>
 <v75ul2$19j7l$5@dont-email.me> <v77s2f$1o4oh$1@dont-email.me>
 <v78gi1$1rc43$6@dont-email.me> <v7d5r0$2t5hr$1@dont-email.me>
 <v7dsit$30pvh$4@dont-email.me> <v7fucc$3fh57$1@dont-email.me>
 <v7gcjm$3hlc2$1@dont-email.me>
 <2c58f962e8efae4d5358494672a22e02e90b4fbb@i2pn2.org>
 <v7genn$3hlc2$6@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 20 Jul 2024 13:53:24 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3938153"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <v7genn$3hlc2$6@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 4289
Lines: 57

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.