busy beaver
Sign in to saveAlso known as busy beaver problem
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states
Also known as busy beaver problem
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states