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
Wikidata facts
- Subclass of
- Turing machine
- Named after
- beaver
Show 3 more facts
- Commons category
- Busy beavers
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- computability theory
Sources (1)
via Wikidata · CC0