busy beaver (Q1427965)
Jump to navigation
Jump to search
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states
- busy beaver problem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | busy beaver |
a halting, binary-alphabet Turing machine which writes the most 1s on the tape, using only a limited set of states |
|
Statements
Busy beavers
0 references
Identifiers
0 references
Sitelinks
Wikipedia(12 entries)
- dewiki Fleißiger Biber
- enwiki Busy beaver
- fiwiki Busy beaver
- frwiki Castor affairé
- hewiki הבונה העסוק
- itwiki Alacre castoro
- jawiki ビジービーバー
- kowiki 바쁜 비버
- nlwiki Busy beaver
- plwiki Pracowity bóbr
- ptwiki Algoritmo do castor
- zhwiki 忙碌的海狸
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Busy beavers