Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Fred. Zwarts" <F.Zwarts@HetNet.nl>
Newsgroups: comp.theory
Subject: Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using
 Finite String Transformations
Date: Tue, 22 Apr 2025 21:30:11 +0200
Organization: A noiseless patient Spider
Lines: 28
Message-ID: <vu8qo3$vn9b$4@dont-email.me>
References: <vsnchj$23nrb$2@dont-email.me> <vto4vh$23i07$1@dont-email.me>
 <vto7qu$267in$1@dont-email.me> <k%RLP.1232047$Xb1.539402@fx05.ams4>
 <vtorpb$2uac$1@news.muc.de> <vtp32o$2vb5o$1@dont-email.me>
 <vtqpt5$17ns$1@news.muc.de> <vtrhbc$16pbv$2@dont-email.me>
 <vtrk7l$t44$1@news.muc.de> <vtrmfa$1be3n$1@dont-email.me>
 <vtvkgo$vjvi$1@dont-email.me> <vu2042$34l74$1@dont-email.me>
 <vu519u$1s5f9$1@dont-email.me> <vu6aha$2vn05$3@dont-email.me>
 <vu6dk4$2fq2$1@news.muc.de> <vu6knm$394oo$1@dont-email.me>
 <vu8cgm$2p5e$1@news.muc.de> <vu8gml$v0qa$2@dont-email.me>
 <vu8m2h$vn9b$2@dont-email.me> <vu8pr1$13jl5$8@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 22 Apr 2025 21:30:12 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="221625c8ee30a140870d84331232caab";
	logging-data="1039659"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+zFFgkFf4uRliSgS7OpVL2"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:qHnPMNic2U1M+WX/uFsx4uiyY8w=
In-Reply-To: <vu8pr1$13jl5$8@dont-email.me>
Content-Language: nl, en-GB
Bytes: 2901

Op 22.apr.2025 om 21:14 schreef olcott:
> On 4/22/2025 1:10 PM, Fred. Zwarts wrote:
>> Op 22.apr.2025 om 18:38 schreef olcott:
>>>
>>> a function is computable if there exists an algorithm
>>> that can do the job of the function, i.e. given an input
>>> of the function domain it can return the corresponding output.
>>> https://en.wikipedia.org/wiki/Computable_function
>>>
>>> On Turing Machines inputs <are> finite strings, and
>>> finite string transformation rules <are> applied to
>>> these finite strings to derive corresponding outputs.
>>>
>> And it has been proven that no finite string transformations are 
>> possible that report the halting behaviour for all inputs that specify 
>> a correct program. 
> 
> int sum(int x, int y) { return x + y; }
> Only when people stupid assume the same thing as
> sum(3,2) should return the sum of 5 + 3.
> 
Therefore HHH should report on the actual input, the finite string that 
describes a halting program. Not on the hypothetical input that does not 
halt, because it is based on a hypothetical HHH that does not abort.

Why do you maintain that HHH should process the hypothetical input 
instead of the actual input.
Do you really believe that 3+2 equals 5+3?