|
|
A119683
|
|
Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Christian Hercher (ch(AT)wurzel.org), Jun 08 2006
|
|
STATUS
|
approved
|
|
|
|