Sujet : Re: Unpartial Halt Decider 4.0
De : Keith.S.Thompson+u (at) *nospam* gmail.com (Keith Thompson)
Groupes : comp.theoryDate : 19. Apr 2025, 21:00:42
Autres entêtes
Organisation : None to speak of
Message-ID : <87y0vvncph.fsf@nosuchdomain.example.com>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Gnus/5.13 (Gnus v5.13)
Mr Flibble <
flibble@red-dwarf.jmc.corp> writes:
[...]
Theorem (Flibble’s Model-Theoretic Parity Principle):
In any theoretical system that permits infinite computational behavior, a
decider analyzing that system may be equipped with equivalent infinite
resources, so long as both reside in a consistent meta-model.
If that's a theorem, what's the proof?
-- Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.comvoid Void(void) { Void(); } /* The recursive call of the void */
Re: Unpartial Halt Decider 4.0
Re: Unpartial Halt Decider 4.0
