Sujet : Re: HHH(DDD) computes the mapping from its input to HHH emulating itself emulating DDD --- anyone that says otherwise is a liar
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 03. Dec 2024, 03:46:01
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vilrda$3n1ap$1@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
User-Agent : Mozilla Thunderbird
On 11/28/2024 1:48 PM, joes wrote:
Am Thu, 28 Nov 2024 11:57:23 -0600 schrieb olcott:
On 11/28/2024 11:06 AM, Richard Damon wrote:
On 11/28/24 11:43 AM, olcott wrote:
On 11/28/2024 9:47 AM, Richard Damon wrote:
On 11/28/24 10:01 AM, olcott wrote:
DDD emulated by any HHH cannot possibly reach its "ret" instruction
final halt state.
>
But that DDD CAN'T be emulated more than 4 instructions by ANY pure
function, as you can't emulate past the call HHH instruction.
>
You just aren't paying any attention at all or are woefully inaccurate
in your word choice. HHH1 does emulate all of DDD.
HHH1 <is> a pure function.
Strawman. We are talking about HHH.
HHH1 has identical source-code to HHH the only difference
is that DDD does not call HHH at all, thus does not call
HHH in recursive emulation.
*You said*
DDD CAN'T be emulated more than 4 instructions by
ANY pure function...
Sure it can! It can be emulated by pure function HHH1
It HHH1 an element of the set of pure functions?
YES IT IS THUS YOU ARE WRONG !!!
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer