00810nas a2200109 4500008004100000245007500041210006900116520042500185100001400610700002000624856005600644 2005 eng d00aComment on ``Some non-conventional idesa about algorithmic complexity"0 aComment on Some nonconventional idesa about algorithmic complexi3 aWe 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.1 aPoulin, D1 aTouchette, Hugo uhttps://www.physique.usherbrooke.ca/pages/node/6202