OFFSET
0,2
COMMENTS
A Turing machine is halt-free if none of its instructions lead to the halt state.
This sequence is strictly less than A052200(n) for all n > 0, since halt-free n-state machines are a strict subset of all n-state machines.
Solutions to the so-called "Beeping Busy Beaver" problem will almost certainly be halt-free programs.
LINKS
Scott Aaronson, The Busy Beaver Frontier.
Nick Drozd, Beeping Busy Beavers.
FORMULA
a(n) = ((4*n)^2)^n.
PROG
(Python) [((4 * n) ** 2) ** n for n in range(12)]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Nicholas Drozd, Aug 11 2020
STATUS
approved