1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2011★ 1 cited
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
Hector Zenil, Jean-Paul Delahaye
It is discussed and surveyed a numerical method proposed before, that alternative to the usual compression method, provides an approximation to the algorithmic (Kolmogorov) complex…
cs.CC2010
Complejidad descriptiva y computacional en maquinas de Turing pequenas
Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil
We start by an introduction to the basic concepts of computability theory and the introduction of the concept of Turing machine and computation universality. Then se turn to the ex…