Comment on "Some non-conventional ideas about algorithmic complexity"

Details Comment on "Some non-conventional ideas about algorithmic complexity" Comment on "Some non-conventional ideas about algorithmic complexity"

2005-03-16

arxiv.org/abs/cs/0503034v1

Computer Science

Computational Complexity

Short comment, 2 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Comment on "Some non-conventional ideas about algorithmic complexity" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comment on "Some non-conventional ideas about algorithmic complexity", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comment on "Some non-conventional ideas about algorithmic complexity" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568932