Results 11 to 20 of about 4,793 (299)
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy [PDF]
Entropy, 2019 The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probability that a system will be in a certain state compared to the rest of the ...
Hector Zenil +2 more
doaj +2 more sources
Algorithmic randomness and measures of complexity [PDF]
Bulletin of Symbolic Logic, 2013 AbstractWe survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles.
Barmpalias, George
openaire +3 more sources
Scholarpedia, 2007 We consider algorithmic randomness in the Cantor space C of the infinite binary sequences. By an algorithmic randomness concept one specifies a set of elements of C, each of which is assigned the property of being random.
Rodney G. Downey, Jan Reimann 0001
openaire +2 more sources
Black Holes and Complexity via Constructible Universe
Universe, 2020 The relation of randomness and classical algorithmic computational complexity is a vast and deep subject by itself. However, already, 1-randomness sequences call for quantum mechanics in their realization.
Jerzy Król, Paweł Klimasara
doaj +1 more source
Frontiers in Computational Neuroscience, 2023 Being able to objectively characterize the intrinsic complexity of behavioral patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems.
Hector Zenil +4 more
doaj +1 more source
Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity [PDF]
Royal Society Open Science, 2018 Natural selection explains how life has evolved over millions of years from more primitive forms. The speed at which this happens, however, has sometimes defied formal explanations when based on random (uniformly distributed) mutations.
Santiago Hernández-Orozco +2 more
doaj +1 more source
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Kohtaro Tadaki, Norihisa Doi
openaire +2 more sources
Re-Consolidating First-Order Masking Schemes
Transactions on Cryptographic Hardware and Embedded Systems, 2020 Application of masking, known as the most robust and reliable countermeasure to side-channel analysis attacks, on various cryptographic algorithms has dedicated a lion’s share of research to itself.
Aein Rezaei Shahmirzadi, Amir Moradi
doaj +3 more sources
Quantum algorithmic randomness [PDF]
Journal of Mathematical Physics, 2021 Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces.
openaire +2 more sources
Entropy, 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 +1 more source