Problems in number theory from busy beaver competition
By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges. This article takes up the following one: How can a small Turing machine manage to produc...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Logical Methods in Computer Science e.V.
2015-12-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/1611/pdf |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|