Results 21 to 30 of about 4,793 (299)
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
Computable Measure Theory and Algorithmic Randomness [PDF]
, 2021 International audienceWe provide a survey of recent results in computable measure and probability theory, from both the perspectives of computable analysis and algorithmic randomness, and discuss the relations between ...
Hoyrup, Mathieu +3 more
core +1 more source
On elementary computability-theoretic properties of algorithmic randomness [PDF]
, 2022 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
A Arslanov (13503478)
core +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 and Noise in Information Systems [PDF]
, 2013 This dissertation is devoted to the study of randomness and noise in a number of information systems including computation systems, storage systems, and natural paradigms like molecular systems, where randomness plays important and distinct roles ...
Zhou, Hongchao
core +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.
Sam Buss, Mia Minnes
openaire +2 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
On the Randomized Kaczmarz Algorithm [PDF]
IEEE Signal Processing Letters, 2014 The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \cite{c2}. Illustrative experiments are conducted to support the findings.
Liang Dai 0002 +2 more
openaire +2 more sources
Algorithmic randomness and analysis [PDF]
, 2017 In this thesis we study the interaction between algorithmic randomness and mathematical analysis. In particular, we focus on the connection between analysis and the fields of effective dimension and resource bounded randomness.
Stull, Donald
core +2 more sources
Topics in algorithmic randomness and computable analysis [PDF]
, 2018 This dissertation develops connections between algorithmic randomness and computable analysis. In the first part, it is shown that computable randomness can be defined robustly on all computable probability spaces, and that computable randomness is ...
Jason Rute (5372324)
core +1 more source