Sujet : Re: DDD specifies recursive emulation to HHH and halting to HHH1
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 01. Apr 2025, 04:10:07
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vsflef$1s8b0$4@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
User-Agent : Mozilla Thunderbird
On 3/31/2025 10:02 PM, dbush wrote:
On 3/31/2025 10:57 PM, olcott wrote:
On 3/31/2025 9:48 PM, dbush wrote:
On 3/31/2025 10:38 PM, olcott wrote:
>
HHH must report on the behavior that its input
actually specifies.
>
And the input specifies an algorithm that halts when executed directly.
>
>
Which is NOT how it is executed.
But IS what it is required to report on.
It IS executed with recursive emulation.
Finitely recursive emulation, which is part of the algorithm DDD that halts.
>
This seems way too difficult
for people that can only spout off words that
they learned by rote, with no actual understanding
of the underlying principles involved.
>
Every actual computation can only transform input
finite strings into outputs. HHH does do this.
>
But not as per the requirements:
>
>
>
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
>
>
>
The "requirements" that you mindlessly spout off
>
Which would make all true statements provable if they could be met.
>
violate this foundational principle of functions
computed by Turing machines.
>
Which just says that no Turing machine satisfies those requirements, as Linz and others proved.
>
>
int sum(int x, int y)
{
return 5;
}
>
sum(2,3) does not compute the sum of 2 + 3.
>
>
>
It absolutely does. There are *NO* requirements on the implementation, only the result.
>
Unless and algorithm transforms its inputs
into its outputs it is not a Turing computable
function.
>
The only requirements of an algorithm are to generate the results of a mapping. How that is accomplished is irrelevant.
It may have been historically considered irrelevant.
When it comes down to determining that mere guesses
are not any sort of: "computing the mapping" then it
does become relevant.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…