Re: Halting Problem: What Constitutes Pathological Input

On 5/5/25 10:18 PM, olcott wrote:

On 5/5/2025 8:59 PM, dbush wrote:

On 5/5/2025 8:57 PM, olcott wrote:

On 5/5/2025 7:49 PM, dbush wrote:

>
Which starts with the assumption that an algorithm exists that performs the following mapping:
>
>
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
>
>
>

DO COMPUTE THAT THE INPUT IS NON-HALTING
IFF (if and only if) the mapping FROM INPUTS
IS COMPUTED.

>
i.e. it is found to map something other than the above function which is a contradiction.
>

>
The above function VIOLATES COMPUTER SCIENCE.
You make no attempt to show how my claim
THAT IT VIOLATES COMPUTER SCIENCE IS INCORRECT
you simply take that same quote from a computer
science textbook as the infallible word-of-God.

>
All you are doing is showing that you don't understand proof by contradiction,

 Not at all. The COMPUTER SCIENCE of your requirements IS WRONG!
 

No, YOU don't understand what Computer Science actually is talking about.
You can't "Prove by Contradiction" using something that doesn't meet the original requiremnets,
Part of your problem is you don't understand what a Program is, and seem to be too stupid to learn.