Liste des Groupes | Revenir à theory |
On 4/29/2025 5:00 AM, joes wrote:Which is stipulated to be a complete description of algorithm P with input DAm Mon, 28 Apr 2025 21:50:03 -0500 schrieb olcott:On 4/28/2025 3:13 PM, Richard Heathfield wrote:>What matters is whether a TM can be constructed that can accept anYet it is H(P,D) and NOT P(D) that must be measured. Computer science
arbitrary TM tape P and an arbitrary input tape D and correctly
calculate whether, given D as input, P would halt. Turing proved that
such a TM cannot be constructed.
This is what we call the Halting Problem.
>
has been wrong about this all of these years. When I provide the 100%
concrete example of the x86 language there is zero vagueness to slip
through the cracks of understanding.No, H gets P(D) as input, not itself. H is the "measurer", not beingH NEVER gets P(D) as input.
measured.
>
H always gets finite strings P and D as inputs.
Les messages affichés proviennent d'usenet.