login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081419 Largest value held in any register at the end of a halting computation by an n-instruction register Minski machine. 1

%I

%S 0,1,2,3,4,6,9,34,520

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

%C We start with initially empty registers and include exactly one Halt instruction. Analogous to the Busy Beaver function, Sigma, for Turing Machines.

%C n<=5 are proved. 5<n<=9 are good lower bounds.

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

%F Noncomputable.

%e E.g. B(3) is of the form:

%e 1: A+ -> 2

%e 2: A+ -> 3

%e 3: Halt

%e Halting with B(3)=2

%Y Cf. A028444.

%K hard,nice,nonn

%O 1,3

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 19:36 EDT 2021. Contains 347608 sequences. (Running on oeis4.)