Sujet : Re: DDD specifies recursive emulation to HHH and halting to HHH1
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 01. Apr 2025, 12:39:11
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <50d30a5443434491fe128a04a8fe47293d1e5235@i2pn2.org>
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/25 11:10 PM, olcott wrote:
On 3/31/2025 10:02 PM, dbush wrote:
>
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.
>
One important thing to add, is you can't just look at an algorithm and necessarily say if it is right or wrong.
For instance, your program to add to numbers might be correctly done with a program that never actually directly added the two numbers.
If could have done the anti-log to some base of the two numbers, multiplied them, and then taken the log.
These operations might be obfuscated further, making it hard to see that this is what was done.
It is a proven fact in computation theory that the task of determining if two arbitrary machines compute the same mapping is uncomputable. We can easily prove if they are not, by showing a case where they differ, but we might not be able to prove that they always produce the same results (sometimes we can, but not generally).