cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A081419 Largest value held in any register at the end of a halting computation by an n-instruction register Minski machine.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 9, 34, 520
Offset: 1

Views

Author

Rick J. Griffiths (rjg42(AT)cam.ac.uk), Apr 20 2003

Keywords

Comments

We start with initially empty registers and include exactly one Halt instruction. Analogous to the Busy Beaver function, Sigma, for Turing Machines.
n<=5 are proved. 5

Examples

			E.g. B(3) is of the form:
1: A+ -> 2
2: A+ -> 3
3: Halt
Halting with B(3)=2

References

  • Tibor Rado, On Noncomputable Functions, Bell System Technical Journal, vol. 41, # 3, 877-884, May 1963.

Crossrefs

Cf. A028444.

Formula

Noncomputable.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.