- idUS
- Investigación
- Arte y Humanidades
- Filosofía y Lógica y Filosofía de la Ciencia
- Listar Filosofía y Lógica y Filosofía de la Ciencia por autor
Listar Filosofía y Lógica y Filosofía de la Ciencia por autor "Zenil, Hector"
Mostrando ítems 1-9 de 9
-
Artículo
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
Soler Toscano, Fernando; Zenil, Hector (Hindawi/Wiley, 2017)Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, ...
-
Artículo
A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity
Zenil, Hector; Hernández Orozco, Santiago; Kiani, Narsis; Soler Toscano, Fernando; Rueda Toicen, Antonio; Tegnér, Jesper (MDPI, 2018)We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method ...
-
Artículo
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (Public Library of Science, 2014)Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the ...
-
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
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (IOS Press, 2013)We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as ...
-
Artículo
Fractal dimension versus process complexity
Joosten, Joost J.; Soler Toscano, Fernando; Zenil, Hector (Hindawi Publishing Corporation, 2016)We look at small Turing machines (TMs) that work with just two colors (alphabet symbols) and either two or three states. ...
-
Artículo
Human behavioral complexity peaks at age 25
Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Brugger, Peter; Gauvrit, Nicolas (Public Library of Science, 2017)Random Item Generation tasks (RIG) are commonly used to assess high cognitive abilities such as inhibition or sustained ...
-
Artículo
Natural scene statistics mediate the perception of image complexity
Gauvrit, Nicolas; Soler Toscano, Fernando; Zenil, Hector (Taylor & Francis, 2014)Humans are sensitive to complexity and regularity in patterns (Falk & Konold, 1997; Yamada, Kawabe, & Miyazaki, 2013). The ...
-
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Gauvrit, Nicolas (PeerJ, 2015)We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a ...