1) Computability theory
Found on
https://www.crosswordclues.com/clue/busy-beaver
In computability theory, a busy beaver is a Turing machine that attains the maximum number of steps performed, or maximum number of nonblank symbols finally on the tape, among all Turing machines in a certain class. The Turing machines in this class must meet certain design specifications and are required to eventually halt after being started wit...
Found on
http://en.wikipedia.org/wiki/Busy_beaver
No exact match found.
