Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: dbush Newsgroups: comp.theory Subject: Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD) Date: Mon, 12 May 2025 13:30:42 -0400 Organization: A noiseless patient Spider Lines: 46 Message-ID: References: <09cea75db07408dc9203aca3fb74408ad3a095b4.camel@gmail.com> <853816e160c7b3fe75c71f0728e72989d9fb2e41.camel@gmail.com> <41e08841caf0d628beb5105bc78531a412eea440.camel@gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 12 May 2025 19:30:42 +0200 (CEST) Injection-Info: dont-email.me; posting-host="d587ba6f088c47ed8fd2ad250ebfd646"; logging-data="1225169"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+h4SEEBdLjk2gxNEzMh5gW" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:8J57EgYMjRbnnr7kKnp4msmgKUg= Content-Language: en-US In-Reply-To: On 5/12/2025 1:16 PM, olcott wrote: > On 5/12/2025 12:07 PM, dbush wrote: >> On 5/12/2025 12:54 PM, olcott wrote: >>> On 5/12/2025 11:41 AM, dbush wrote: >>>> 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: >>>> >>> >>> Definitions that contradict other definitions are refuted. >>> >> >> >> And you haven't shown a conflict with the definition of a solution to >> the halting problem: >> > > That you keep ignoring it its not > a matter of me never providing it. > In other words, you agree that no algorithm exists that can compute the following mapping: Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as with input Y: A solution to the halting problem is an algorithm H that computes the following mapping: (,Y) maps to 1 if and only if X(Y) halts when executed directly (,Y) maps to 0 if and only if X(Y) does not halt when executed directly