Sujet : Re: Halt Deciders must be computable functions --- dbush was always wrong
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 24. Mar 2025, 01:01:53
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <4dddcc0340b82c30e5edd1e27d31320972b3eb4a@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 29 30 31 32
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sun, 23 Mar 2025 15:08:25 -0500 schrieb olcott:
The behavior of a directly executing Turing Machine cannot be computed
because a directly executing Turing machine cannot be the input to any
computable function.
Lol. This is such a ridiculously silly objection. Of course a TM is
nothing but a finite string (or can be encoded as such). TMs are
most definitely computable - UTMs are possible.
-- 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.
Halt Deciders must be computable functions --- dbush was always wrong
Re: Halt Deciders must be computable functions --- dbush was always wrong