Results 31 to 40 of about 4,793 (299)
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
Entropy, 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 +1 more source
INSAM, 2023 This study explores the utilization of blockchain data as a set of pseudorandom numbers in the context of microtonal algorithmic composition. Conventional methods of generating indiscriminate numbers often lack the desired levels of unpredictability and ...
Krzysztof Kicior
doaj +1 more source
LT^2C^2: A language of thought with Turing-computable Kolmogorov complexity [PDF]
Papers in Physics, 2013 In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following requirements: 1) to be ...
Santiago Figueira +2 more
doaj +3 more sources
Proofs of randomized algorithms in Coq [PDF]
Science of Computer Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audebaud, Philippe +1 more
openaire +3 more sources
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]
The Journal of Symbolic Logic, 2016 AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense.
Denis R. Hirschfeldt +3 more
openaire +2 more sources
Proceedings, 2020 Current approaches in science, including most machine and deep learning methods, rely heavily at their core on traditional statistics and information theory, but these theories are known to fail to capture certain fundamental properties of data and the ...
Hector Zenil
doaj +1 more source
Algorithmic Randomness and Fourier Analysis [PDF]
Theory of Computing Systems, 2018 Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin +2 more
openaire +3 more sources
On Elementary Computability-Theoretic Properties of Algorithmic Randomness [PDF]
, 2001 In this paper we apply some elementary computability-theoretic notions to algorithmic complexity theory with the aim of understanding the role and extent of computability techniques for algorithmic complexity theory. We study some computability-theoretic
Arslanov, Asat
core +1 more source
An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory
Entropy, 2008 Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity).
Joel Ratsaby
doaj +1 more source
Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments
Entropy, 2012 In evolutionary biology, attention to the relationship between stochastic organisms and their stochastic environments has leaned towards the adaptability and learning capabilities of the organisms rather than toward the properties of the environment ...
David A. Rosenblueth +3 more
doaj +1 more source