Deutsch English Français Italiano |
<vb4orn$2tk86$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott <polcott333@gmail.com> Newsgroups: comp.theory Subject: No not believe Liars that changed their name to mine speak for me --- this is libelous Date: Mon, 2 Sep 2024 11:24:23 -0500 Organization: A noiseless patient Spider Lines: 28 Message-ID: <vb4orn$2tk86$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Mon, 02 Sep 2024 18:24:23 +0200 (CEST) Injection-Info: dont-email.me; posting-host="a2fe8748f6382997edaeece42547d6b5"; logging-data="3068166"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+hd7wXfoAOTZfkaTFQ9Pgm" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:W22JvIqrBssMW0l0qyc26mFpV9c= Content-Language: en-US Bytes: 1972 A halt decider is a Turing machine that computes the mapping from its finite string input to the behavior that this finite string specifies. If the finite string machine string machine description specifies that it cannot possibly reach its own final halt state then this machine description specifies non-halting behavior. A halt decider never ever computes the mapping for the computation that itself is contained within. Unless there is a pathological relationship between the halt decider H and its input D the direct execution of this input D will always have identical behavior to D correctly simulated by simulating halt decider H. Simulating Termination Analyzer H is Not Fooled by Pathological Input D https://www.researchgate.net/publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer