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...

Descripció completa

Dades bibliogràfiques

Autor principal:	Pascal Michel
Format:	Artigo
Idioma:	Inglês
Publicat:	Logical Methods in Computer Science e.V. 2015-12-01
Col·lecció:	Logical Methods in Computer Science
Matèries:	mathematics - logic computer science - computational complexity computer science - logic in computer science
Accés en línia:	https://lmcs.episciences.org/1611/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!