Deutsch   English   Français   Italiano  
<657eac3dbcc39c614e0621abe9031e3ca105eb57@i2pn2.org>

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

Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Correcting the definition of the halting problem --- Computable
 functions
Date: Mon, 24 Mar 2025 21:28:28 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <657eac3dbcc39c614e0621abe9031e3ca105eb57@i2pn2.org>
References: <vr1shq$1qopn$1@dont-email.me> <vr6oic$1udpn$3@dont-email.me>
 <vr77tp$2bojc$1@dont-email.me> <vr790m$2cr9u$1@dont-email.me>
 <vr7c5g$2g9ma$1@dont-email.me> <vr7lbe$2o5t3$1@dont-email.me>
 <vr8p32$3pf1l$1@dont-email.me> <vr9elt$bv13$2@dont-email.me>
 <vr9jpt$gave$2@dont-email.me> <vr9lj6$j0f0$2@dont-email.me>
 <vr9qu8$m4cu$2@dont-email.me> <vr9ttl$q57o$1@dont-email.me>
 <vr9u5m$q57o$2@dont-email.me> <vrbckn$23f4t$1@dont-email.me>
 <vrbtiq$2j07c$2@dont-email.me> <vrc3ud$2p461$1@dont-email.me>
 <vrc4nu$2m36k$5@dont-email.me> <vrkc2m$24ft6$1@dont-email.me>
 <vrkdij$25f9f$3@dont-email.me> <vrlt36$3haib$1@dont-email.me>
 <vrn237$im1e$1@dont-email.me> <vrn67b$md49$1@dont-email.me>
 <cb974817db8e02049daa5604d725300154e33ad1@i2pn2.org>
 <vrps14$35a4m$2@dont-email.me>
 <eab11e8806c669d296bff986870bdc6abdbb2fef@i2pn2.org>
 <vrqicu$3s258$1@dont-email.me>
 <30c2beae6c191f2502e93972a69c85ff227bfd03@i2pn2.org>
 <vrrs79$11a56$7@dont-email.me> <vrrsta$tdm5$1@dont-email.me>
 <vrs264$1a43i$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 25 Mar 2025 01:28:28 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1621106"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <vrs264$1a43i$1@dont-email.me>
Bytes: 4362
Lines: 60

On 3/24/25 12:44 PM, olcott wrote:
> On 3/24/2025 10:14 AM, dbush wrote:
>> On 3/24/2025 11:03 AM, olcott wrote:
>>> On 3/24/2025 6:23 AM, Richard Damon wrote:
>>>> On 3/23/25 11:09 PM, olcott wrote:
>>>>> It is impossible for HHH compute the function from the direct
>>>>> execution of DDD because DDD is not the finite string input
>>>>> basis from which all computations must begin.
>>>>> https://en.wikipedia.org/wiki/Computable_function
>>>>
>>>> WHy isn't DDD made into the correct finite string?i
>>>>
>>>
>>> DDD is a semantically and syntactically correct finite
>>> stirng of the x86 machine language.
>>
>> Which includes the machine code of DDD, the machine code of HHH, and 
>> the machine code of everything it calls down to the OS level.
>>
>>>
>>>> That seems to be your own fault.
>>>>
>>>> The problem has always been that you want to use the wrong string 
>>>> for DDD by excluding the code for HHH from it.
>>>>
>>>
>>> DDD emulated by HHH directly causes recursive emulation
>>> because it calls HHH(DDD) to emulate itself again. HHH
>>> complies until HHH determines that this cycle cannot
>>> possibly reach the final halt state of DDD.
>>>
>>
>> Which is another way of saying that HHH can't determine that DDD halts 
>> when executed directly.
>>
> 
> given an input of the function domain it can
> return the corresponding output.
> https://en.wikipedia.org/wiki/Computable_function
> 
> Computable functions are only allowed to compute the
> mapping from their input finite strings to an output.
> 

Nope, got the requirement a bit sideways. The only CAN compute the 
mapping there code generates as the output, but MUST compute the mapping 
they are defined to compute to be correct.

Thus, since the Halting Mapping is from the description of the Program, 
to whether that program itself when run will halt, if that mapping was 
computable, there would exist a program that could do it. Since there 
isn't one, as proven by Turing, the Halting Mapping isn't a Computable 
Function.

Your flaw is that you PRESUME computability just because you are writing 
a program, and fail to understand that not all functions are, in fact, 
computable

You run into this confusion because you just failed to learn the meaning 
of the basic terms of the field, and just made up your own, so you 
became just an ignorant lying fraudster.