Liste des Groupes | Revenir à theory |
On 7/4/2024 5:20 AM, joes wrote:Why can a termination analyser emulate an infinite loop as a finite one?Am Wed, 03 Jul 2024 10:51:40 -0500 schrieb olcott:On 7/3/2024 10:40 AM, Fred. Zwarts wrote:Op 03.jul.2024 om 16:29 schreef olcott:On 7/3/2024 9:16 AM, joes wrote:Am Wed, 03 Jul 2024 08:27:40 -0500 schrieb olcott:On 7/3/2024 6:44 AM, Richard Damon wrote:Open question.On 7/2/24 11:43 PM, olcott wrote:On 7/2/2024 10:23 PM, Richard Damon wrote:Why do they get to lie?On 7/2/24 11:07 PM, olcott wrote:Not for a freaking termination analyzer nitwit.On 7/2/2024 9:35 PM, Richard Damon wrote:And the only CORRECT EMULATION of that program is toOn 7/2/24 10:03 PM, olcott wrote:On 7/2/2024 8:51 PM, Richard Damon wrote:On 7/2/24 9:32 PM, olcott wrote:On 7/2/2024 8:25 PM, Richard Damon wrote:On 7/2/24 9:18 PM, olcott wrote:
infiniately loop in the emulation.
How does HHH track it?If the state is actually the same. But the simulated HHH sets aAs soon as HHH has seen a repeating state it has seen enough.BEHAVIOR needs the FULL description of what happens.Nothing says that you can't make a halt decider work with
partial emulation for SOME inputs. But the halt Decider just
isn't itself a fully correct emulator.
flag or something to keep track if it is itself simulating a
repetition. <- Which it therefore isn’t.
„State” does not mean calling the same function again. It means the sameIf the state doesn’t repeat infinitely often, it is not the same stateThe criteria that I spent two years writing and the best selling*This is the repeating state*But not an *infinitely* repeating state.
author of theory of computation textbooks agrees with says nothing
about *infinitely* repeating state.
and does halt.
It took me two years to come up with these words please make sure thatI do. It is not very difficult. The point is that H doesn’t simulate D
you totally understand each one of them.
Les messages affichés proviennent d'usenet.