Results 1 to 10 of about 44,248 (151)

Information Complexity Ranking: A New Method of Ranking Images by Algorithmic Complexity [PDF]

open access: yesEntropy, 2023
Predicting how an individual will perceive the visual complexity of a piece of information is still a relatively unexplored domain, although it can be useful in many contexts such as for the design of human–computer interfaces.
Thomas Chambon   +2 more
doaj   +4 more sources

Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations [PDF]

open access: yesEntropy, 2018
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs.
Hector Zenil   +2 more
doaj   +4 more sources

Statistical Complexity Analysis of Turing Machine tapes with Fixed Algorithmic Complexity Using the Best-Order Markov Model [PDF]

open access: yesEntropy, 2020
Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexity because they create structures that follow algorithmic schemes, rather than generating symbols from a probabilistic function assuming independence.
Jorge M. Silva   +3 more
doaj   +4 more sources

A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity [PDF]

open access: yesEntropy, 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 of algorithmic ...
Hector Zenil   +5 more
doaj   +4 more sources

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions [PDF]

open access: yesEntropy, 2020
Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging from dominant ones such as statistical lossless compression to newer ...
Hector Zenil
doaj   +4 more sources

Algorithmic Relative Complexity [PDF]

open access: yesEntropy, 2011
Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively.
Daniele Cerra, Mihai Datcu
doaj   +3 more sources

Algorithmic complexity stratification for congenital heart disease patients [PDF]

open access: yesInternational Journal of Cardiology Congenital Heart Disease, 2023
Background: Congenital Heart Disease (CHD) encompasses a huge variety of rare diagnoses that range in complexity and comorbidity. To help build clinical guidelines, plan health services and conduct statistically powerful research on such a disparate set ...
Jason Chami   +6 more
doaj   +2 more sources

Algorithmic Complexity of Multiplex Networks [PDF]

open access: yesPhysical Review X, 2020
Multilayer networks preserve full information about the different interactions among the constituents of a complex system, and have recently proven quite useful in modeling transportation networks, social circles, and the human brain.
Andrea Santoro, Vincenzo Nicosia
doaj   +5 more sources

Information Theory in Perception of Form: From Gestalt to Algorithmic Complexity [PDF]

open access: yesEntropy
In 1948, Claude Shannon published a revolutionary paper on communication and information in engineering, one that made its way into the psychology of perception and changed it for good. However, the path to truly successful applications to psychology has
Daniel Algom, Daniel Fitousi
doaj   +2 more sources

A Review of Graph and Network Complexity from an Algorithmic Information Perspective

open access: yesEntropy, 2018
Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths
Hector Zenil   +2 more
doaj   +3 more sources

Home - About - Disclaimer - Privacy