Random Continuous Functions

DOI10.1016/j.entcs.2006.08.016zbMath1262.03065OpenAlexW1999041719MaRDI QIDQ4921446

Paul Brodhead, Douglas Cenzer, Jeffery B. Remmel

Publication date: 10 May 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.016

zbMATH Keywords

random realMartin-Löf testrandom closed setrandom function

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items

Algorithmically Random Functions and Effective Capacities, Computable Measure Theory and Algorithmic Randomness

Cites Work

• Information-theoretic characterizations of recursive infinite strings
• Effectively closed sets and graphs of computable real functions.
• Arithmetical representations of Brownian motion I
• The definition of random sequences
• Logical Approaches to Computational Barriers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item