Results 21 to 30 of about 55,876 (328)
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
Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence [PDF]
, 2010 This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence.
Hutter, Marcus
core +3 more sources
Randomized priority algorithms
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelopoulos, Spyros, Borodin, Allan
openaire +4 more sources
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
Probabilistic Algorithmic Randomness
The Journal of Symbolic Logic, 2013 AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness.
Buss, Sam, Minnes, Mia
openaire +2 more sources
Merging of opinions in game-theoretic probability [PDF]
, 2007 This paper gives game-theoretic versions of several results on "merging of opinions" obtained in measure-theoretic probability and algorithmic randomness theory.
Vovk, Vladimir
core +4 more sources
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