In computability theory, a busy beaver is a Turing machine that attains the maximum ‘operational busyness’ (such as measured by the number of steps performed, or the number of nonblank symbols finally on the tape) among all the Turing machines in a certain class. (Wikipedia) With a beaver-like ethic, Justene Williams’s seven small monitors in the […]
Justene Williams
