Deutsch   English   Français   Italiano  
<70587fef0c8d2a97a7e3684c48b857381b6ed3a3@i2pn2.org>

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

Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Halting Problem: What Constitutes Pathological Input
Date: Wed, 7 May 2025 06:43:06 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <70587fef0c8d2a97a7e3684c48b857381b6ed3a3@i2pn2.org>
References: <GE4SP.47558$VBab.42930@fx08.ams4> <vvb5ca$o4v0$10@dont-email.me>
 <vvb5vp$15u5b$7@dont-email.me> <vvb675$o4v0$11@dont-email.me>
 <vvb9d7$1av94$3@dont-email.me> <vvbani$1b6l1$1@dont-email.me>
 <vvbb6s$1av94$4@dont-email.me> <vvbcb3$1b6l1$2@dont-email.me>
 <vvbe0j$1av94$8@dont-email.me> <vvbecc$1b6l1$6@dont-email.me>
 <vvbhk0$1ijna$1@dont-email.me> <vvbjjg$1kegb$1@dont-email.me>
 <vvbk93$1l4cf$1@dont-email.me> <vvbkft$1kegb$4@dont-email.me>
 <vvbl71$1ljaj$1@dont-email.me> <vvbma3$1kegb$5@dont-email.me>
 <vvbmp0$1ljaj$2@dont-email.me> <vvbqd5$1tr5o$1@dont-email.me>
 <vvbrha$1us1f$1@dont-email.me>
 <b5dffdb99fdbfe0cd74914de4d51abe0aa439e7d@i2pn2.org>
 <vvdj0r$3cbpq$9@dont-email.me>
 <db8999eda88b9152608e58380b8ef7d00862dbaa@i2pn2.org>
 <vvdrtn$3n3t4$3@dont-email.me> <vvdskd$3lapa$5@dont-email.me>
 <vvdt3d$3n3t4$7@dont-email.me> <vvdu0o$3lapa$8@dont-email.me>
 <vve0hj$3s3g9$1@dont-email.me>
 <cfaf8c77bbb3b119ad41d2f8f33013dbac94aec9@i2pn2.org>
 <vveg8c$89u0$6@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 7 May 2025 11:13:28 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3507609"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <vveg8c$89u0$6@dont-email.me>

On 5/6/25 10:24 PM, olcott wrote:
> On 5/6/2025 5:57 PM, Richard Damon wrote:
>> On 5/6/25 5:56 PM, olcott wrote:
>>> On 5/6/2025 4:12 PM, dbush wrote:
>>>> On 5/6/2025 4:57 PM, olcott wrote:
>>>>> On 5/6/2025 3:49 PM, dbush wrote:
>>>>>> On 5/6/2025 4:37 PM, olcott wrote:
>>>>>>> On 5/6/2025 3:22 PM, joes wrote:
>>>>>>>> Am Tue, 06 May 2025 13:05:15 -0500 schrieb olcott:
>>>>>>>>> On 5/6/2025 5:59 AM, Richard Damon wrote:
>>>>>>>>>> On 5/5/25 10:18 PM, olcott wrote:
>>>>>>>>>>> On 5/5/2025 8:59 PM, dbush wrote:
>>>>>>>>>>>> On 5/5/2025 8:57 PM, olcott wrote:
>>>>>>>>>>>>> On 5/5/2025 7:49 PM, dbush wrote:
>>>>>>>>
>>>>>>>>>>>>>>> DO COMPUTE THAT THE INPUT IS NON-HALTING IFF (if and only 
>>>>>>>>>>>>>>> if) the
>>>>>>>>>>>>>>> mapping FROM INPUTS IS COMPUTED.
>>>>>>>>>>>>>> i.e. it is found to map something other than the above 
>>>>>>>>>>>>>> function
>>>>>>>>>>>>>> which is a contradiction.
>>>>>>>>>>>>> The above function VIOLATES COMPUTER SCIENCE. You make no 
>>>>>>>>>>>>> attempt to
>>>>>>>>>>>>> show how my claim THAT IT VIOLATES COMPUTER SCIENCE IS 
>>>>>>>>>>>>> INCORRECT you
>>>>>>>>>>>>> simply take that same quote from a computer science 
>>>>>>>>>>>>> textbook as the
>>>>>>>>>>>>> infallible word-of-God.
>>>>>>>> What does it violate?
>>>>>>>>
>>>>>>>>>>>> All you are doing is showing that you don't understand proof by
>>>>>>>>>>>> contradiction,
>>>>>>>>>>> Not at all. The COMPUTER SCIENCE of your requirements IS WRONG!
>>>>>>>>>> No, YOU don't understand what Computer Science actually is 
>>>>>>>>>> talking
>>>>>>>>>> about.
>>>>>>>>> Every function computed by a model of computation must apply a 
>>>>>>>>> specific
>>>>>>>>> sequence of steps that are specified by the model to the actual 
>>>>>>>>> finite
>>>>>>>>> string input.
>>>>>>>
>>>>>>>> You are very confused. An algorithm or program computes a function.
>>>>>>>>
>>>>>>>
>>>>>>> Nothing computes a function unless it applies a specific
>>>>>>> set of rules to its actual input to derive its output.
>>>>>>> Anything that ignores its input is not computing a function.
>>>>>>>
>>>>>>
>>>>>> False.  Anything that correctly associates a function's input to a 
>>>>>> function's output for all elements of the function's domain does 
>>>>>> in fact compute that function.
>>>>>>
>>>>>>
>>>>>> For example, given this function:
>>>>>>
>>>>>> For all integers X and Y:
>>>>>> (X,Y) maps to 5
>>>>>>
>>>>>> This algorithm computes it:
>>>>>>
>>>>>> int foo(int X, int Y) { return 5; }
>>>>>>
>>>>>
>>>>> The rules that must be applied to the inputs
>>>>> are
>>>>
>>>> Anything that can associate the input with the output.
>>>>
>>>
>>> WRONG!
>>> Any defined process that CAUSES an INPUT to be associated
>>> with an OUTPUT.
>>>
>>
>> And it does, it causes ALL inputs to be associated with the value 5.
> 
> Ignoring the input cannot possibly be construed
> as computing the mapping from the input.
> 

Sure it can.

You just don't really understand the meaning of the words, showig how 
stupid you are.

After all, times_zero(x) doesn't need to know what its input is to give 
an answer according to the mapping it is defined to give.