|
Search: id:A052200
|
|
|
| A052200 |
|
Number of n-state 2-symbol 5-tuple Turing machines. |
|
+0
6
|
|
| 1, 64, 20736, 16777216, 25600000000, 63403380965376, 232218265089212416, 1180591620717411303424, 7958661109946400884391936, 68719476736000000000000000000, 739696442014594807059393047166976, 9711967541295580042210555933809967104, 152784834199652075368661148843397208866816
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This sequence is computable. On the other hand, the busy beaver numbers are non-calculatable, found only by examining each of the many n-state Turing machine programs' halting. - Michael Joseph Halm (hierogamous(AT)lycos.com), Apr 29 2003
|
|
REFERENCES
|
J. P. Jones, Recursive undecidability - an exposition, Amer. Math. Monthly, 81 (1974), 724-738.
|
|
LINKS
|
M. Somos, The Busy Beaver Problem
Index entries for sequences related to Busy Beaver problem
|
|
FORMULA
|
a(n) = (4*(n+1))^(2*n)
|
|
EXAMPLE
|
a(1) = 64 = (4*1+4)^(2*1) = 8^2
|
|
CROSSREFS
|
Cf. A028444, A004147, A060843.
Sequence in context: A089208 A083282 A082502 this_sequence A146517 A009497 A145258
Adjacent sequences: A052197 A052198 A052199 this_sequence A052201 A052202 A052203
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Michael Somos, Jan 28 2000
|
|
EXTENSIONS
|
Entry revised by N. J. A. Sloane (njas(AT)research.att.com), Feb 08 2007
|
|
|
Search completed in 0.002 seconds
|
