Liste des Groupes | Revenir à theory |
On 3/13/2025 1:03 PM, dbush wrote:The halting problem involves finding an algorithm H that satisfies these requirements:On 3/13/2025 2:02 PM, olcott wrote:Yes I am happy because my doctor and I had a long conversationOn 3/13/2025 12:53 PM, dbush wrote:>On 3/13/2025 1:51 PM, olcott wrote:>On 3/13/2025 12:43 PM, dbush wrote:>>>
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.
>
Then it's a good thing we're talking about a solution to the halting problem instead of a decider.
In other words you have no idea that the halting
problem requires a halt decider and a halt decider
must be a decider. Your ignorance is not my mistake.
>
Your claim was that something that satisfies the definition of a solution to the halting problem doesn't satisfy the definition of a decider. We fixed that by not calling it a decider.
>
Happy?
that involved several good options to keep me alive longer.
You already know that your reasoning is unsound unless you
can show that the halting problem never involved a halt decider.
Les messages affichés proviennent d'usenet.