Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott2@gmail.com>
Newsgroups: comp.theory
Subject: Re: olcott machines defy the laws of thermodynamics
Date: Fri, 8 Mar 2024 13:17:49 -0600
Organization: A noiseless patient Spider
Lines: 73
Message-ID: <usfo8t$1s1nb$4@dont-email.me>
References: <usd5ot$a7f$1@reader1.panix.com> <usesk9$1lk0a$1@dont-email.me>
 <usfclk$1p8cg$2@dont-email.me> <MmIGN.375143$vFZa.293337@fx13.iad>
 <usfkcd$1rdpp$2@dont-email.me> <9YIGN.461274$c3Ea.142857@fx10.iad>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 8 Mar 2024 19:17:49 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="cbe692f823dc8310f00dd0aaf1f84978";
	logging-data="1967851"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/dedZV9Dhq05PYQXwFqE+n"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:aFyyLPZ8ZTaTsnzP4mC58pQMFFU=
In-Reply-To: <9YIGN.461274$c3Ea.142857@fx10.iad>
Content-Language: en-US
Bytes: 3898

On 3/8/2024 12:40 PM, Richard Damon wrote:
> On 3/8/24 10:11 AM, olcott wrote:
>> On 3/8/2024 12:00 PM, Richard Damon wrote:
>>> On 3/8/24 7:59 AM, olcott wrote:
>>>> On 3/8/2024 5:26 AM, Mikko wrote:
>>>>> On 2024-03-07 19:49:49 +0000, Dan Cross said:
>>>>>
>>>>>> What is it?  The olcott machine is a device that never halts and
>>>>>> generates infinite amounts of nonsense.  As a perpetual motion
>>>>>> device with no discernable input and unbounded output, it is
>>>>>> believed that it violates the laws of thermodynamics.
>>>>>
>>>>> The olcott machine uses a hidden input.
>>>>>
>>>>
>>>> It is not hidden. The master UTM of Olcott machines simply
>>>> appends the TMD to the end of the simulated TMD's tape.
>>>>
>>>> Only those machines that need to see if themselves are
>>>> called in recursive simulation use this optional input.
>>>>
>>>
>>> Which means they ADMIT they are doing a different computation then 
>>> the Turing Machine they are derived from.
>>>
>>> So, there can not be an Olcott Machine that matches the signature of 
>>> a Halt Decider.
>>>
>>> PERIOD
>>>
>>> And thus, you prove you have created another worthless field.
>>
>> I am working on the computability of the halting problem
>> (the exact same TMD / input pairs) by a slightly augmented
>> notion of Turing machines as elaborated below:
>>
>> Olcott machines are entirely comprised of a UTM + TMD and one
>> extra step that any UTM could perform, append the TMD to the end
>> of its own tape.
>>
>> Olcott machines that ignore this extra input compute the exact
>> same set of functions that Turing machines compute.
>>
>> Olcott machines can do something that no Turing machine can
>> possibly do correctly determine that they themselves are
>> called in recursive simulation.
>>
> 
> Nope.
> 
> You have PROVED (by your definition of an Olcott Machine) that ANYTHING 
> an Olcott machine can do, there exists a Turing Machine that does the 
> same thing.
There is no conventional Turing machine that can possibly
know that it is about to simulate a copy of itself in
recursive simulation.

Olcott machines make it impossible for a machine to not
know its own machine description.

When we construct an Olcott machine on the basis of Turing
machines then within this limited environment every machine
has the same ability as an Olcott machine.

Outside of this environment the Linz H can implement this
protocol for all of its inputs. It cannot implement this
protocol for itself. This seems to be a key point of failure
for Turing Machines.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer