FROM BI-IMMUNITY TO ABSOLUTE UNDECIDABILITY.

An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp [2] asked whether, unlike the case for bi-immunity, there is an absolutely unde...

Descripción completa

Detalles Bibliográficos

Publicado en:	Journal of Symbolic Logic Vol. 78; no. 4; pp. 1218 - 1229
Autores principales:	BIENVENU, LAURENT, DAY, ADAM R., HÖLZL, RUPERT
Formato:	Artículo
Publicado:	Cambridge University Press Dec2013
Materias:	Algebraic immunity Algebraic attacks (Cryptography) Boolean algebra Turing (Computer program language) Turing test
Acceso en línea:	Ver este registro en EBSCOhost