Re: Flibble's Law

Richard Damon <richard@damon-family.org> writes:

On 4/18/25 5:01 PM, Mr Flibble wrote:

[...]

If Busy Beavers are allowed an INFINITE tape in the context of the
Halting Problem then Simulating Halt Deciders are allowed INFINITE
resources.

>
Sure, they can use as much tape as they want, they just can't use
infinite time.

And any halt decider, or other Turing machine, that terminates in a
finite amount of time must use only a finite amount of tape.

There is no upper bound on the amount of time or tape it can use, but
that amount is always finite (and possibly ludicrously huge).

[...]

--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */