Liste des Groupes | Revenir à c theory |
On 3/13/2025 1:51 PM, olcott wrote:In other words you have no idea that the haltingOn 3/13/2025 12:43 PM, dbush wrote:Then it's a good thing we're talking about a solution to the halting problem instead of a decider.>>
It is by the stipulated definition of a solution to the halting problem:
>
>
Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as <X> with input Y:
>
A solution to the halting problem is an algorithm H that computes the following mapping:
>
(<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
>
WHEN THE STIPULATED DEFINITION OF [HALT DECIDER]
CONTRADICTS THE STIPULATED DEFINITION OF [DECIDER]
IT IS WRONG.
>
Les messages affichés proviennent d'usenet.