Results 11 to 20 of about 207,048 (241)
Notions and applications of algorithmic randomness [PDF]
, 2013 Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy,
Vermeeren, Stijn
core +6 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
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
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 +1 more source
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
Generic Hardware Private Circuits
Transactions on Cryptographic Hardware and Embedded Systems, 2021 With an increasing number of mobile devices and their high accessibility, protecting the implementation of cryptographic functions in the presence of physical adversaries has become more relevant than ever.
David Knichel +2 more
doaj +1 more source
Randomness is Unpredictability [PDF]
, 2005 The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed.
Eagle, Antony
core +1 more source
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