Randomness extraction in computability theory

DOI10.3233/COM-210343OpenAlexW3133895011MaRDI QIDQ5880936

Christopher P. Porter, Douglas Cenzer

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

computability theoryalgorithmic randomnessrandomness extraction

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (1)

Extraction rates of random continuous functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strict process machine complexity
• Randomness on computable probability spaces -- a dynamical point of view
• Algorithmic randomness of continuous functions
• Dimension extractors and optimal decompression
• Iterating von Neumann's procedure for extracting random bits
• Online computability and differentiation in the Cantor space
• Randomness and Non-ergodic Systems
• L1-Computability, Layerwise Computability and Solovay Reducibility
• The dimension of ergodic random sequences
• Algorithmically Random Functions and Effective Capacities
• Von Neumann's Biased Coin Revisited
• An Introduction to Randomness Extractors
• Algorithmic Randomness and Complexity
• General random sequences and learnable sequences
• Interval algorithm for random number generation
• Kolmogorov Complexity and Algorithmic Randomness
• Algorithmic Randomness
• Computational Complexity
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The Efficient Construction of an Unbiased Random Sequence

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