Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Keith Thompson <Keith.S.Thompson+u@gmail.com>
Newsgroups: comp.theory
Subject: Re: Flibble's Law
Date: Fri, 18 Apr 2025 15:49:18 -0700
Organization: None to speak of
Lines: 21
Message-ID: <87jz7hnl01.fsf@nosuchdomain.example.com>
References: <HjxMP.837300$7Fq7.451049@fx13.ams4>
	<19955e68400bc2ad935f413f012fe04011f7cf75@i2pn2.org>
	<V4zMP.1406251$NN2a.623234@fx15.ams4>
	<7c47bbe68c1cf317ddb2a0418564127c1471e11b@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain
Injection-Date: Sat, 19 Apr 2025 00:49:27 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="b62a019a496a9456e80ffe1b61d2a7b5";
	logging-data="4175327"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18u0DVznkoGZUDqu8clD53w"
User-Agent: Gnus/5.13 (Gnus v5.13)
Cancel-Lock: sha1:Vj/pn/pYyhHBGbPw9cgfT9xfDMI=
	sha1:Aau76W56w4hPVgcSPnV2HZXKIMk=
Bytes: 1809

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 */