Imagen de Portada
Código QR

MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY.

By the complexity of a finite sequence of 0's and 1's we mean the Kolmogorov complexity, that is the length of the shortest input to a universal recursive function which returns the given sequence as output. By initial segment complexity of an infinite sequence of 0's and 1's we mean the asymptotic...

Descripción completa

Publicado en:Journal of Symbolic Logic Vol. 79; no. 1; pp. 20 - 45
Autor principal: HUDELSON, W. M. PHILLIP
Formato: Artículo
Publicado: Cambridge University Press Mar2014
Materias:
Kolmogorov complexity
Recursive functions
Electronic data processing
Information theory
Machine theory
Acceso en línea:Ver este registro en EBSCOhost