Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
Autor/es | Zenil, Hector
Soler Toscano, Fernando Delahaye, Jean-Paul Gauvrit, Nicolas |
Departamento | Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia |
Fecha de publicación | 2015 |
Fecha de depósito | 2017-09-06 |
Publicado en |
|
Resumen | We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional ... We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex n-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequency of occurrence of a pattern with its algorithmic complexity, hence effectively providing estimations to the complexity of the generated patterns. Experiments to validate estimations of algorithmic complexity based on these concepts are presented, showing that the measure is stable in the face of some changes in computational formalism and that results are in agreement with the results obtained using lossless compression algorithms when both methods overlap in their range of applicability. We then use the output frequency of the set of 2-dimensional Turing machines to classify the algorithmic complexity of the space-time evolutions of Elementary Cellular Automata. |
Cita | Zenil, H., Soler Toscano, F., Delahaye, J. y Gauvrit, N. (2015). Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility. PeerJ Computer Sciense, 1:e23, 1-31. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Two-dimensional.pdf | 2.919Mb | [PDF] | Ver/ | |
Este registro aparece en las siguientes colecciones
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution 4.0 Internacional
Items relacionados
Enseñando items relacionados por título, autor, creador y materia.
-
Artículo
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Zenil, Hector; Soler Toscano, Fernando; Dingle, Kamaludin; Louis, Ard A. (Elsevier, 2014)We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and ...
-
Artículo
Protonolysis of Fe-C bonds of a diiminopyridineiron(II) dialkyl complex by acids of different strengths: Influence of monoanionic ligands on the spectroscopic properties of diiminopyiridine-FeY2 complexes
Cartes Domínguez, María Ángeles; Palma Ramírez, María del Pilar; Sandoval Valencia, John Jairo; Cámpora Pérez, Juan; Álvarez González, Eleuterio (Elsevier, 2014)The reaction of the dialkyliron complex [Fe(CH2SiMe 3)2(MesBIP)] (MesBIP = 2,6-bis((N-mesityl)acetimidoyl)pyridine) with ...