Extracting randomness from the trend of IPI for cryptographic operations in implantable medical devices
Achieving secure communication between an Implantable Medical Device (IMD) and a
gateway or programming device outside the body has showed its criticality in recent reports …
gateway or programming device outside the body has showed its criticality in recent reports …
Logic Blog 2016
A Nies - arxiv preprint arxiv:1703.01573, 2017 - arxiv.org
This year's logic blog contains a variety of results, some of them available only here.
Highlights include the resolution of the Gamma question by Monin, and a number of entries …
Highlights include the resolution of the Gamma question by Monin, and a number of entries …
Strong reductions in effective randomness
L Bienvenu, C Porter - Theoretical Computer Science, 2012 - Elsevier
We study generalizations of Demuth's Theorem, which states that the image of a Martin-Löf
random real under a tt-reduction is either computable or Turing equivalent to a Martin-Löf …
random real under a tt-reduction is either computable or Turing equivalent to a Martin-Löf …
[HTML][HTML] From Wald to Schnorr: von Mises' definition of randomness in the aftermath of Ville's Theorem
FZ Blando - Studies in History and Philosophy of Science, 2024 - Elsevier
The first formal definition of randomness, seen as a property of sequences of events or
experimental outcomes, dates back to Richard von Mises' work in the foundations of …
experimental outcomes, dates back to Richard von Mises' work in the foundations of …
Computable measure theory and algorithmic randomness
Computable Measure Theory and Algorithmic Randomness Page 1 Chapter 7 Computable
Measure Theory and Algorithmic Randomness Mathieu Hoyrup and Jason Rute Abstract We …
Measure Theory and Algorithmic Randomness Mathieu Hoyrup and Jason Rute Abstract We …
[BOOK][B] Patterns and Probabilities: A Study in Algorithmic Randomness and Computable Learning
FZ Blando - 2020 - search.proquest.com
This dissertation bridges the theory of algorithmic randomness—a branch of computability
theory—and the foundations of inductive learning. Algorithmic randomness provides a …
theory—and the foundations of inductive learning. Algorithmic randomness provides a …
[HTML][HTML] When does randomness come from randomness?
J Rute - Theoretical Computer Science, 2016 - Elsevier
A result of Shen says that if F: 2 N→ 2 N is an almost-everywhere computable, measure-
preserving transformation, and y∈ 2 N is Martin-Löf random, then there is a Martin-Löf …
preserving transformation, and y∈ 2 N is Martin-Löf random, then there is a Martin-Löf …
Kolmogorov-Loveland betting strategies lose the Betting game on open sets
T Petrović - arxiv preprint arxiv:2403.19817, 2024 - arxiv.org
If Kolmogorov-Loveland randomness (KLR) is the same as Martin-L\" of randomness (MLR)
is a major open problem in the study of algorithmic randomness. More general classes of …
is a major open problem in the study of algorithmic randomness. More general classes of …
Computable randomness is about more than probabilities
F Persiau, J De Bock, G De Cooman - Scalable Uncertainty Management …, 2020 - Springer
We introduce a notion of computable randomness for infinite sequences that generalises the
classical version in two important ways. First, our definition of computable randomness is …
classical version in two important ways. First, our definition of computable randomness is …
A universal pair of 1/2-betting strategies
T Petrović - Information and Computation, 2021 - Elsevier
A universal pair of 1/2-betting strategies - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …