Liste des Groupes | Revenir à theory |
On 4/28/2025 2:58 PM, dbush wrote:<snip>
No, it proves that you agree that it's not a computable function. QED.Category error. The halting function below is fully defined, and this mapping is not computable *as you have explicitly admitted*.Neither is the square root of an actual onion computable.
>
Turing Computable Functions are required to apply finite
string transformations to their inputs. The function defined
below ignores that requirement PROVING THAT IT IS INCORRECT.
--Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as <X> with input Y:
>
(<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
(<X>,Y) maps to 0 if and only if X(Y) does not halt when executed directly
Les messages affichés proviennent d'usenet.