Sujet : Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)
De : dbush.mobile (at) *nospam* gmail.com (dbush)
Groupes : comp.theoryDate : 12. May 2025, 17:41:36
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvt8bv$15ceh$9@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
User-Agent : Mozilla Thunderbird
On 5/12/2025 12:19 PM, olcott wrote:
On 5/12/2025 10:06 AM, dbush wrote:
On 5/12/2025 11:04 AM, olcott wrote:
Termination analyzers compute the mapping from their
inputs to the behavior that these inputs actually specify.
>
False. They compute the mapping from their input to the behavior of the algorithm described by the input when executed directly, as per the requirements:
>
That is easily proven stupidly wrong.
Category error. Definitions are not proven:
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