Notions of Probabilistic Computability on Represented Spaces

DOI10.1016/j.entcs.2008.03.013zbMath1262.03077MaRDI QIDQ4918035

Volker Bosserhoff

Publication date: 3 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.2008.03.013

zbMATH Keywords

computable analysis; computable measure theory

Mathematics Subject Classification ID

28A12: Contents, measures, outer measures, capacities

03D78: Computation over the reals, computable analysis

Related Items

Closed choice and a uniform low basis theorem, Are unbounded linear operators computable on the average for Gaussian measures?, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Probabilistic computability and choice, Computability on measurable functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domain theory and integration
• Three concepts of decidability for general subsets of uncountable spaces
• Computability of measurable sets via effective topologies
• Representing probability measures using probabilistic processes
• Computability on random variables
• Computability on the probability measures on the Borel sets of the unit interval
• Extended admissibility.
• A computable version of the Daniell-Stone theorem on integration and linear functionals
• Uniform test of algorithmic randomness over a general space
• Finite approximation of measure and integration
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• Admissible Representations of Probability Measures
• On Computable Metrization
• Computability of measurable sets via effective metrics