Deutsch   English   Français   Italiano  
<vep17n$2brl4$2@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: The actual truth is that ... industry standard stipulative
 definitions
Date: Wed, 16 Oct 2024 13:38:47 -0500
Organization: A noiseless patient Spider
Lines: 52
Message-ID: <vep17n$2brl4$2@dont-email.me>
References: <ve39pb$24k00$1@dont-email.me> <vedibm$4891$2@dont-email.me>
 <72315c1456c399b2121b3fffe90b933be73e39b6@i2pn2.org>
 <vee6s1$7l0f$1@dont-email.me>
 <1180775691cf24be4a082676bc531877147202e3@i2pn2.org>
 <veec23$8jnq$1@dont-email.me>
 <c81fcbf97a35bd428495b0e70f3b54e545e8ae59@i2pn2.org>
 <vef37r$bknp$2@dont-email.me>
 <7e79306e9771378b032e6832548eeef7429888c4@i2pn2.org>
 <veikaf$14fb3$1@dont-email.me> <veipmb$15764$2@dont-email.me>
 <c56fcfcf793d65bebd7d17db4fccafd1b8dea072@i2pn2.org>
 <vejfg0$1879f$3@dont-email.me>
 <bde5947ebdcfb62ecd6e8968052cb3a25c4b1fec@i2pn2.org>
 <vekfi5$1d7rn$1@dont-email.me>
 <6d73c2d966d1d04dcef8f7f9e0c849e17bd73352@i2pn2.org>
 <velnqn$1n3gb$3@dont-email.me>
 <b06c4952248d83881642c7d84207d3d39c56c59f@i2pn2.org>
 <vend90$22rqh$1@dont-email.me> <vens4t$250b2$1@dont-email.me>
 <veos78$29dtl$7@dont-email.me>
 <97040a77da33a22295b056e260c896fd96f1ac94@i2pn2.org>
 <veotuk$2baph$2@dont-email.me>
 <491c00831ebf446c6420485722f7db2da67af9fb@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 16 Oct 2024 20:38:47 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="f097d53e4abea8ea9babea4b430282e3";
	logging-data="2485924"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/TpEuKHrJZraOkd4eDoaIP"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:tKc/Ec4bLrws7lf0YcTxCT5brf0=
Content-Language: en-US
In-Reply-To: <491c00831ebf446c6420485722f7db2da67af9fb@i2pn2.org>
Bytes: 4591

On 10/16/2024 1:09 PM, joes wrote:
> Am Wed, 16 Oct 2024 12:42:43 -0500 schrieb olcott:
>> On 10/16/2024 12:24 PM, joes wrote:
>>> Am Wed, 16 Oct 2024 12:13:12 -0500 schrieb olcott:
>>>> On 10/16/2024 3:05 AM, Mikko wrote:
>>>>> On 2024-10-16 03:52:00 +0000, olcott said:
>>>>>> On 10/15/2024 9:11 PM, Richard Damon wrote:
>>>>>>> On 10/15/24 8:39 AM, olcott wrote:
>>>>>>>> On 10/15/2024 4:58 AM, joes wrote:
>>>>>>>>> Am Mon, 14 Oct 2024 20:12:37 -0500 schrieb olcott:
>>>>>>>>>> On 10/14/2024 6:50 PM, Richard Damon wrote:
>>>>>>>>>>> On 10/14/24 12:05 PM, olcott wrote:
>>>>>>>>>>>> On 10/14/2024 6:21 AM, Richard Damon wrote:
> 
>>>>>>>>>>> But, you claim to be working on that Halting Problem,
>>>>>>>>>> I quit claiming this many messages ago and you didn't bother to
>>>>>>>>>> notice.
>>>>>>>>> Can you please give the date and time? Did you also explicitly
>>>>>>>>> disclaim it or just silently leave it out?
>>>>>>>> Even people of low intelligence that are not trying to be as
>>>>>>>> disagreeable as possible would be able to notice that a specified
>>>>>>>> C function is not a Turing machine.
>>>>>>> But it needs to be computationally equivalent to one to ask about
>>>>>>> Termination.
>>>>>> A termination analyzer need not be a Turing computable function.
>>>>> There is no known way to construct one that isn't. No computer can
>>>>> execute a function that is not Turing computable.
>>>> In other words you think that functions that rely on global data such
>>>> that they are not a pure function of their inputs are A OK?
>>> Says the one with an if(Root).
>>> Apart from that, purity has nothing to do with computability.
>> Quite a few experts agree that the purity of a function ensures its
>> computability. It was like pulling teeth to get this out of them. It was
>> like the computer science experts desperately wanted to remain totally
>> ignorant of mapping computer science to software engineering.
> Decide_Halting() is not pure.
> 

That Decide_Halting() is not pure at most shows that it
is not Turing computable. This is only relevant to whether
or not HHH is Turing Computable.

*It is not relevant to this*
HHH is correctly emulating (not simulating) the x86 language
finite string of DDD including emulating the finite string of
itself emulating the finite string of DDD up until the point
where the emulated emulated DDD would call HHH(DDD) again.


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