Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: What it would take... People to address my points with reasoning
 instead of rhetoric
Date: Tue, 13 May 2025 21:10:32 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <4cd55109d08769cb0deda9aca278ce8da77ddec6@i2pn2.org>
References: <vvm948$34h6g$2@dont-email.me> <87v7q5n3sc.fsf@bsb.me.uk>
 <vvtf7n$17c1i$5@dont-email.me> <87plgdmldp.fsf@bsb.me.uk>
 <vvudut$1ife1$1@dont-email.me> <vvuii0$1j0qo$1@dont-email.me>
 <vvuk0d$1j6s0$5@dont-email.me> <vvvbtd$1ov7e$10@dont-email.me>
 <vvvpia$1tcfq$1@dont-email.me> <vvvqd1$1tgam$1@dont-email.me>
 <vvvrhl$1so2t$2@dont-email.me> <vvvtki$1tgam$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 14 May 2025 01:41:12 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="255527"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vvvtki$1tgam$3@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US

On 5/13/25 12:56 PM, olcott wrote:
> On 5/13/2025 11:21 AM, dbush wrote:
>> On 5/13/2025 12:01 PM, olcott wrote:
>>> On 5/13/2025 10:47 AM, Mike Terry wrote:
>>>> On 13/05/2025 12:54, Fred. Zwarts wrote:
>>>>> Op 13.mei.2025 om 07:06 schreef olcott:
>>>>>> On 5/12/2025 11:41 PM, André G. Isaak wrote:
>>>>>>> On 2025-05-12 21:23, Mike Terry wrote:
>>>>>>>
>>>>>>>> Mind you it does seem to have gone mad the last month or so.  It 
>>>>>>>> seems there are only about 2 or 3 actual variations of what PO 
>>>>>>>> is saying and all the rest is several thousand repeats by both 
>>>>>>>> PO and responders...
>>>>>>>
>>>>>>> Those who insist on responding to Olcott (of which I admit I have 
>>>>>>> occasionally been one despite my better intuitions) would be well 
>>>>>>> advised to adopt something like the rule of ko (in the game go) 
>>>>>>> which prohibits one from returning to the exact same position. 
>>>>>>> Simply repeating the same objection after olcott has ignored it 
>>>>>>> is pointless. If he didn't get the objection the fiftieth time 
>>>>>>> he's not going to get it the fifty-first time either.
>>>>>>>
>>>>>>> If people adopted this policy most of the threads on this forum 
>>>>>>> would be considerably shorter.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> If people would actually address rather than
>>>>>> dishonestly dodge the key points that I making
>>>>>> they would see that I am correct.
>>>>>
>>>>> If olcott would only stop ignoring everything that disturbs his 
>>>>> dreams, he would see that his key points have been addresses and 
>>>>> refuted many times already.
>>>>
>>>> We might call that a disturbing ko.
>>>>
>>>> Mike.
>>>
>>> The actual reasoning why HHH is supposed to report
>>> on the behavior of the direct execution of DD()
>>> instead of the actual behavior that the finite
>>> string of DD specifies:
>>
>> Quite simply, it's the behavior of the direct execution that we want 
>> to know about.
>>
> 
> Just like naive set theory wanted to know
> about Russell's Paradox until ZFC came along
> and ruled that questions about Russell's Paradox
> are based on an incorrect notion of set theory.

But nothing incorect has been shown about computation theory.

IF you want to try to define your POOPS, then go ahead, and see if 
anyone cares about it.

Note, Naive set thoery didn't what to know about Russell's Paradox, as 
things seemed just fine until he discovered it.

To make the analogy, you need to find such a paradox in Computaiton 
Theory using its actual definitions, which you need to start by learning.

Since you have admitted you current system fails to meet the 
requirements, you seem to need to start all over.

Remember, your decider needs to be an actual program, which has been 
fully defined as to what it does (no "do the right thing") and the input 
given to it needs to represent a program, which means it has ALL the 
code it uses, and the criteria needs to be the defined criteria, which 
is if the program that the input represents will halt when run.

Until you figure out how to work those into your proof (good luck) you 
are just shown to be just a pathological liar.

> 
>> The behavior of "HHH simulated by DD" is just not something that 
>> anyone cares about.
>>
>> An H that tells us if any algorithm X with input Y can solve the 
>> Goldbach conjecture and make unknowable truths knowable.
>>
>> An H that tell us if "H simulated by DD" halts doesn't tell us that.
> 
>