Sujet : Re: No TM exists that can simulate all TM.
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 25. Oct 2024, 18:15:51
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <3d1ce08f1c9740a732c629b83c562666ed7e7f03@i2pn2.org>
References : 1
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sat, 26 Oct 2024 01:12:00 +0800 schrieb wij:
Proof: Simulating self is not possible (from all real programs, every
one can verify).
It is possible for a UTM to simulate itself simulating another program.
This also implies UTM does not exist.
Since they do, your premise or deduction must be wrong.
Did Turing made a mistake?
Probably not.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.
No TM exists that can simulate all TM.
Re: No TM exists that can simulate all TM.