Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas

Details Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas

2011-08-26

arxiv.org/abs/1108.5387v2

Computer Science

Computational Complexity

23 pages, 3 figures; Proceedings of the Workshop on Complex Systems as Computing Models 2011

Scientific paper

It is discussed and surveyed a numerical method proposed before, that alternative to the usual compression method, provides an approximation to the algorithmic (Kolmogorov) complexity, particularly useful for short strings for which compression methods simply fail. The method shows to be stable enough and useful to conceive and compare patterns in an algorithmic models. (article in Spanish)

Affiliated with

Also associated with

No associations

Rating

Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas 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 Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-613617