In 2024, a group of internet users verified the value of this function at 5 by proving that a construction of Marxen and Buntrock is maximal. For 10 points each:
[10m] Name this rapidly-growing function introduced by Tibor Radó that returns the largest runtime over all n-state inputs that halt.
ANSWER: busy beaver function [or busy beaver shifts function; prompt on BB(n) or S(n)]
[10e] The busy beaver game is played on a class of these computational models consisting of a read/write head on an infinitely long tape, which are named for a British computer scientist.
ANSWER: Turing machines [accept Alan Mathison Turing]
[10h] Known recursive bounds on the busy beaver function use a form of encoding named for this property. Reflection is a stronger form of this property, the ability of a program to examine the type of an object at runtime.
ANSWER: introspection [accept word forms like introspective; accept introspective encoding or type introspection]
<Jeremy Cummings, Other Science>