Algorithmically Random Functions and Effective Capacities

DOI10.1007/978-3-319-17142-5_4zbMath1461.03037arXiv1503.06328OpenAlexW2144366680MaRDI QIDQ2948450

Douglas Cenzer, Christopher P. Porter

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

capacitycomputability theoryalgorithmic randomnessrandom closed setsrandom continuous functions

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)

Related Items (2)

Randomness extraction in computability theory ⋮ Extraction rates of random continuous functionals

Cites Work

• Martin-Löf randomness and Galton-Watson processes
• Algorithmic randomness of continuous functions
• Strong reductions in effective randomness
• Algorithmic Randomness and Capacity of Closed Sets
• K-Triviality of Closed Sets and Continuous Functions
• Random Continuous Functions
• Algorithmic Randomness of Closed Sets
• The definition of random sequences

This page was built for publication: Algorithmically Random Functions and Effective Capacities