Buscar
Mostrando ítems 1-9 de 9
Artículo
A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity
(MDPI, 2018)
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory ...
Artículo
Human behavioral complexity peaks at age 25
(Public Library of Science, 2017)
Random Item Generation tasks (RIG) are commonly used to assess high cognitive abilities such as inhibition or sustained attention. They also draw upon our approximate sense of complexity. A detrimental effect of aging on ...
Artículo
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
(Elsevier, 2014)
We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of ...
Artículo
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
(Hindawi/Wiley, 2017)
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ...
Artículo
Natural scene statistics mediate the perception of image complexity
(Taylor & Francis, 2014)
Humans are sensitive to complexity and regularity in patterns (Falk & Konold, 1997; Yamada, Kawabe, & Miyazaki, 2013). The subjective perception of pattern complexity is correlated to algorithmic (or Kolmogorov-Chaitin) ...
Artículo
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
(Public Library of Science, 2014)
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of ...
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
(PeerJ, 2015)
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 ...
Artículo
Fractal dimension versus process complexity
(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. For any particular such machine t and any particular input x, we consider what we call the space-time ...
Artículo
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
(IOS Press, 2013)
We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 ...