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

TL;DR

This paper discusses a stable numerical method as an alternative to compression for estimating the Kolmogorov complexity of short strings, enabling better pattern analysis in algorithmic models.

Contribution

It introduces a stable numerical approach for approximating algorithmic complexity, especially effective for short strings where traditional compression fails.

Findings

The method provides reliable complexity estimates for short strings.

It is useful for pattern recognition in algorithmic models.

The approach is an effective alternative to compression-based methods.

Abstract

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)