Extraction rates of random continuous functionals

DOI10.1007/978-3-031-34034-5_4MaRDI QIDQ6149114

Douglas Cenzer, Christopher P. Porter, Cameron Fraize

Publication date: 12 January 2024

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmic randomnesscontinuous functionalsrandom extraction

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Algorithmic randomness of continuous functions
• Iterating von Neumann's procedure for extracting random bits
• Online computability and differentiation in the Cantor space
• Algorithmically Random Functions and Effective Capacities
• Algorithmic Randomness and Complexity
• Kolmogorov Complexity and Algorithmic Randomness
• Algorithmic Randomness
• The axiomatization of randomness
• Computability and Randomness
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Randomness extraction in computability theory