Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 03. May 2025, 20:04:35
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <98a2b8ac02de7fed57c900f38d12932cb1ffd654@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
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sat, 03 May 2025 12:07:49 -0500 schrieb olcott:
HHH determines whether or not DD would halt if HHH would have been a
pure simulator.
Nobody cares about a non-input. In fact HHH is not a pure simulator
but aborts, and DD calls *that same* HHH.
ChatGPT DOES understand hypothetical possibilities and does understand
that HHH computes the termination status of its input on the basis of
these hypothetical possibilities.
Only that is not what is asked of a halt decider.
-- 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.