Équipe de Recherche en Physique de l'Information Quantique


Abstract = {We comment on a recent paper by D'Abramo [Chaos, Solitons \&
Fractals, 25 (2005) 29], focusing on the author's statement that an algorithm
can produce a list of strings containing at least one string whose
algorithmic complexity is greater than that of the entire
list. We show that this statement, although perplexing, is not as
paradoxical as it seems when the definition of algorithmic complexity is
applied correctly.},
Author = {David Poulin and Hugo Touchette},
Date-Added = {2006-01-06 10:50:01 +1000},
Date-Modified = {2010-05-06 13:56:21 -0400},
Eprint = {cs.OH/0503034},
Local-Url = {PT05a.pdf},
Title = {Comment on ``Some non-conventional idesa about algorithmic complexity"},
Year = {2005}}