Path: csiph.com!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Ben Bacarisse Newsgroups: comp.theory Subject: Re: A UTM halt decider a pure function of its inputs (Misinterpretation?) Date: Tue, 30 Mar 2021 16:32:38 +0100 Organization: A noiseless patient Spider Lines: 39 Message-ID: <87sg4codwp.fsf@bsb.me.uk> References: <8o6dnQ-nz5ysPP39nZ2dnUU7-W_NnZ2d@giganews.com> <0e9161be-e9e7-40f5-8e1c-5a6b6229aa60n@googlegroups.com> <_2w8I.126195$qC1.17116@fx37.iad> <20210329202056.955@kylheku.com> <9ZadnYwf29qUp_79nZ2dnUU7-YvNnZ2d@giganews.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="e3b71be8ad597a2de0321f13c0beeca2"; logging-data="8693"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19CXCu6GvwkB8DV2yHBmSsJZwFilIYCALY=" Cancel-Lock: sha1:F1RISV8usUpyXqg0UquWlwJ5wmg= sha1:UPpfSvndmejcJViyESmDxQce8j4= X-BSB-Auth: 1.cf98ee6e0f5eb7e5da9e.20210330163238BST.87sg4codwp.fsf@bsb.me.uk Xref: csiph.com comp.theory:30354 olcott writes: > When we 100% forget everything that I ever said then the fact that a > halt decider implemented as a simulator that returns either true or > false when it completels proves that the H^ infinite loop states are > never reached because every halting problem counter-example specifies > infinite recursion. No one is forgetting that. You have been very clear. > The H^(H^) of the Linz proof exactly as it is specifies infinite > recursion when it is simulated exactly as it is. But this is a junk sentence. The H^ of Linz's proof does not exist. It is a hypothetical TM constructed from a non-existent TM. And TM's don't "recurse". What you mean is that UTM^(UTM^) is a non-halting computation -- i.e. applying the "hat" construction to a "simulator" (specifically a UTM) makes a non-halting computation. Calling the UTM 'H' just so you can pretend this has something to do with your argument is silly, though you need to do that is you are trying to bury the trick you are pulling (so that would be dishonest rather than just silly). When translated back into the world of TMs, you have two: one is a proper simulator, UTM, and the other, Halts, stops some computations mid-simulation. You've rolled these into one in the C sketches, but they are different TMs. Halts(UTM^, UTM^) correctly reports that UTM^(UTM^) is not a finite computation, but Halts^(Halts^) is a different, finite, computation. Anyway, you've made it clear again that UTM^(UTM^) and Halts^(Halts^) are different computations. And I see you've also posted Halts again (in a variation) that also makes the ruse clear. Well done. I don't think you are trying to hide what you are now doing. I think the obfuscation is accidental. -- Ben.