Randomness extraction in computability theory

DOI10.3233/COM-210343MaRDI QIDQ5880936zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Christopher P. Porter

Publication date 9 March 2023

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.03971

zbMATH Keywords

algorithmic randomnesscomputability theoryrandomness extraction

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Recommendations

• Kolmogorov complexity in randomness extraction
• Kolmogorov complexity in randomness extraction
• scientific article; zbMATH DE number 2156273
• Extracting Kolmogorov complexity with applications to dimension zero-one laws
• scientific article; zbMATH DE number 1820017
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• scientific article; zbMATH DE number 5252391

Cites work

• L^1-computability, layerwise computability and Solovay reducibility
• Algorithmic Randomness
• Algorithmic randomness and complexity.
• Algorithmic randomness of continuous functions
• Algorithmically Random Functions and Effective Capacities
• An introduction to randomness extractors
• Computability and randomness
• Computational Complexity
• Dimension extractors and optimal decompression
• General random sequences and learnable sequences
• scientific article; zbMATH DE number 3614066 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• scientific article; zbMATH DE number 5227136 (Why is no real title available?)
• Interval algorithm for random number generation
• Iterating von Neumann's procedure for extracting random bits
• Kolmogorov Complexity and Algorithmic Randomness
• Online computability and differentiation in the Cantor space
• Randomness and non-ergodic systems
• Randomness on computable probability spaces -- a dynamical point of view
• Strict process machine complexity
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The dimension of ergodic random sequences
• The Efficient Construction of an Unbiased Random Sequence
• Von Neumann's biased coin revisited

Cited in

(7)

• Randomness extraction and asymptotic Hamming distance
• Computational Randomness from Generalized Hardcore Sets
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Effective Brenier Theorem
• scientific article; zbMATH DE number 6963652 (Why is no real title available?)
• Computable Measure Theory and Algorithmic Randomness
• Extraction rates of random continuous functionals

This page was built for publication: Randomness extraction in computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880936)