On 5/5/2025 8:57 PM, olcott wrote:Not at all. The COMPUTER SCIENCE of your requirements IS WRONG!On 5/5/2025 7:49 PM, dbush wrote:All you are doing is showing that you don't understand proof by contradiction,>>
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.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
| Date | Sujet | # | Auteur | |
| 3 May 26 |  … |
Les messages affichés proviennent d'usenet.