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 <vrt1tu$257a2$1@dont-email.me>
Deutsch   English   Français   Italiano  
<vrt1tu$257a2$1@dont-email.me>

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

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: =?UTF-8?B?QW5kcsOpIEcuIElzYWFr?= <agisaak@gm.invalid>
Newsgroups: comp.theory
Subject: Re: Correcting the definition of the halting problem --- Computable
 functions
Date: Mon, 24 Mar 2025 19:46:38 -0600
Organization: Christians and Atheists United Against Creeping Agnosticism
Lines: 70
Message-ID: <vrt1tu$257a2$1@dont-email.me>
References: <vr1shq$1qopn$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> <vrs54q$1d1o2$1@dont-email.me>
 <vrse90$1jr8u$1@dont-email.me> <vrsk13$1q39o$1@dont-email.me>
 <vrsn62$1rblu$2@dont-email.me> <vrsnhu$1q39o$2@dont-email.me>
 <vrsodl$1rblu$3@dont-email.me> <vrsogj$1q39o$3@dont-email.me>
 <vrsqlq$1rblu$4@dont-email.me> <vrsrmr$1q39o$4@dont-email.me>
 <vrt14i$264jb$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 25 Mar 2025 02:46:39 +0100 (CET)
Injection-Info: dont-email.me; posting-host="c28cbb8b97d3e83ccc5d9c5cd1c367aa";
	logging-data="2268482"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/0IfoDfdS/x25PN+cVqa2W"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:XFK/2Fwx175BZ5gWG4VWzbEYmU0=
Content-Language: en-US
In-Reply-To: <vrt14i$264jb$1@dont-email.me>
Bytes: 4444

On 2025-03-24 19:33, olcott wrote:
> On 3/24/2025 7:00 PM, André G. Isaak wrote:

>> In the post you were responding to I pointed out that computable 
>> functions are mathematical objects.
> 
> https://en.wikipedia.org/wiki/Computable_function
> 
> Computable functions implemented using models of computation
> would seem to be more concrete than pure math functions.

Those are called computations or algorithms, not computable functions.

The halting problems asks whether there *is* an algorithm which can 
compute the halting function, but the halting function itself is a 
purely mathematical object which exists prior to, and independent of, 
any such algorithm (if one existed).

> For example pure math functions don't have any specific
> storage like a tape or machine registers.

No they don't. Why would they? A mathematical function is simply a 
static mapping from elements of a domain to elements of a codomain.

> This also would seem to mean that they would require
> some actual input.
> 
> 
>> The above copypasta doesn't address this.
>>
>> I pointed out that the domain of a computable function needn't be a 
>> string. The above copypasta doesn't address this.
>>
> 
> When implemented using an actual model of computation
> some concrete form or input seems required.
> 
>> I pointed out that there is no bijection natural numbers and strings, 
> 
> finite strings of decimal digits: [0123456789]
> 
>> but rather a one-to-many relation. The above copypasta doesn't address 
>> this.
> 
> "12579" would seem to have a bijective mapping to
> a single natural number.

The natural number 12579 maps equally to the (decimal) string '012579', 
'0012579',... so there is no bijection.

>>
>> I pointed out that the exact same sort of one-to-many relation exists 
>> between computations and strings. The above copypasta doesn't address 
>> this.
>>
> 
> I pointed out above that the finite string of x86
> machine code correctly emulated by EEE DOES
> NOT MAP TO THE BEHAVIOR OF ITS DIRECT EXECUTION.

But I was not talking about EEE. I was talking about the halting 
function. All you seem to be claiming above is that whatever EEE 
computes, it isn't the halting function. Everyone already agrees to that.

André

-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.