2 ms·
Yes, it's trivial to write a Turing machine that only uses finite space but infinite time. But as you agree, they are of no concern for the computability of Bu
by eru 2y ago
Yes, it's trivial to write a Turing machine that only uses finite space but infinite time.
But as you agree, they are of no concern for the computability of Busy Beaver numbers. (However, they are of major concern for people who want to find Busy Beaver numbers in practice.)