Deutsch English Français Italiano |
<v1s6jp$397iq$3@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: immibis <news@immibis.com> Newsgroups: sci.logic,comp.theory Subject: Re: Termination analyzer defined Date: Mon, 13 May 2024 06:57:29 +0200 Organization: A noiseless patient Spider Lines: 18 Message-ID: <v1s6jp$397iq$3@dont-email.me> References: <v1me7i$1l6ut$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Mon, 13 May 2024 06:57:30 +0200 (CEST) Injection-Info: dont-email.me; posting-host="d2008c1c49405973cf4ca07ee8802bc1"; logging-data="3448410"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/BTTOU40zAUydsMnLdR1Wb" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:07vy+O/uppQ5+feZgymMaobNKvw= In-Reply-To: <v1me7i$1l6ut$1@dont-email.me> Content-Language: en-US Bytes: 1806 On 11/05/24 02:30, olcott wrote: > A termination analyzer is different than a halt decider in that it need > not correctly determine the halt status of every input. For the purposes > of this paper a termination analyzer only needs to correctly determine > the halt status of one terminating input and one non-terminating input. > The computer science equivalent would be a halt decider with a limited > domain that includes at least one halting and one non-halting input. > > The halting problem asks whether there is a program that does correctly determine the halt status of every input. If there are no halt deciders and only termination analyzers, the answer is "no". By the way, this is a termination analyzer in C: bool terminates(ptr program, ptr input) { return !memcmp(program, "SQUIRREL", 8); }