Sujet : Re: Flibble's Law
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 22. Apr 2025, 23:29:24
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <f7ce672021c67a5e6ee05febe8b88093ea526764@i2pn2.org>
References : 1 2 3 4 5
User-Agent : Mozilla Thunderbird
On 4/22/25 8:33 AM, Mr Flibble wrote:
On Fri, 18 Apr 2025 17:13:23 -0400, Richard Damon wrote:
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.
>
/Flibble
>
Sure, they can use as much tape as they want, they just can't use
infinite time.
If they REQUIRE infinite tape then by implication they REQUIRE infinite
time.
/Flibble
Actual Busy Beavers, since they do halt, never actually require infinite tape.
Perspective Busy Beavers, which might not halt, are allowed to use infinite tape, and the decider will need to figure out that they aren't going to halt to know they are not a Busy Beaver.
Note, I never said that the Busy Beaver NEEDED the infinite tape, but there is no finite bound on the tape they are allowed to use, but if they are a Busy Beaver, it will be finite.