Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <46cd4a4ec628588c101c338ab628574ef4675243@i2pn2.org>
Deutsch   English   Français   Italiano  
<46cd4a4ec628588c101c338ab628574ef4675243@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: Turing computable functions
Date: Tue, 25 Mar 2025 18:34:31 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <46cd4a4ec628588c101c338ab628574ef4675243@i2pn2.org>
References: <vruvsn$3tamc$3@dont-email.me> <vrv0d4$3hle3$10@dont-email.me>
 <vrv18e$3tamc$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 26 Mar 2025 00:32:30 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1762229"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vrv18e$3tamc$4@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0

On 3/25/25 3:47 PM, olcott wrote:
> On 3/25/2025 2:32 PM, dbush wrote:
>> On 3/25/2025 3:24 PM, olcott wrote:
>>> Cannot possibly derive any outputs not computed from
>>> their inputs.
>>
>> Correct, algorithms can only compute computable mathematical function.
>>
>>>
>>> A Turing machine halt decider 
>>
>> Does not exist because the required mapping is not computable:
>>
>>
>> Given any algorithm (i.e. a fixed immutable sequence of instructions) 
>> X described as <X> with input Y:
>>
>> A solution to the halting problem is an algorithm H that computes the 
>> following mapping:
>>
>> (<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
>> (<X>,Y) maps to 0 if and only if X(Y) does not halt when executed 
>> directly
>>
>>
>>
>>> cannot possibly report
>>> on the behavior of any directly executing process.
>>> No Turing machine can every do this. This has always
>>> been beyond what any Turing machine can ever do.
>>
>>
>> Strawman: reporting on an executing process is not a requirement. 
> 
> YOU JUST SAID THAT IT WAS
> YOU KEEP MINDLESSLY REPEATING THAT IT IS

Right, we don't neefd to see the executing process, and it never needs 
to be executed to have the behavior, the mapping just is what it is.

Something you seem to stupid to understand.

> 
> On 3/25/2025 2:32 PM, dbush wrote:
>  > (<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
> 
>