Sujet : Re: HHH maps its input to the behavior specified by it --- key error in all the proofs --- Mike --- basis
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 15. Aug 2024, 09:46:53
Autres entêtes
Organisation : -
Message-ID : <v9kf9t$t9ab$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 24
User-Agent : Unison/2.2
On 2024-08-14 13:42:33 +0000, olcott said:
On 8/14/2024 2:30 AM, Mikko wrote:
On 2024-08-13 13:30:08 +0000, olcott said:
On 8/13/2024 6:23 AM, Richard Damon wrote:
On 8/12/24 11:45 PM, olcott wrote:
void DDD()
{
HHH(DDD);
return;
}
*DDD correctly emulated by HHH cannot possibly reach its*
*own "return" instruction final halt state, thus never halts*
Which is only correct if HHH actuallly does a complete and correct emulation, or the behavior DDD (but not the emulation of DDD by HHH) will reach that return.
A complete emulation of a non-terminating input has always
been a contradiction in terms.
HHH correctly predicts that a correct and unlimited emulation
of DDD by HHH cannot possibly reach its own "return" instruction
final halt state.
That is not a meaningful prediction because a complete and unlimited
emulation of DDD by HHH never happens.
A complete emulation is not required to correctly
predict that a complete emulation would never halt.
Nice to see that you don't disagree.
-- Mikko