A computable version of the Daniell-Stone theorem on integration and linear functionals

DOI10.1016/J.TCS.2006.01.050zbMath1106.03042OpenAlexW2081744753MaRDI QIDQ2503282

Yongcheng Wu, Weihrauch, Klaus

Publication date: 14 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.050

zbMATH Keywords

measure theorycomputable analysisDaniell-Stone theorem

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Integration theory via linear functionals (Radon measures, Daniell integrals, etc.), representing set functions and measures (28C05)

Related Items (11)

Computability of measurable sets via effective topologies ⋮ Computability on measurable functions ⋮ Computability on random events and variables in a computable probability space ⋮ Computable Riesz Representation for Locally Compact Hausdorff Spaces ⋮ Notions of Probabilistic Computability on Represented Spaces ⋮ An Application of Martin-Löf Randomness to Effective Probability Theory ⋮ Algorithmic randomness over general spaces ⋮ Absolutely non-computable predicates and functions in analysis ⋮ A computable approach to measure and integration theory ⋮ Computability of the Radon-Nikodym Derivative ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Computability on random variables
• Computability on the probability measures on the Borel sets of the unit interval
• Dynamical systems, measures, and fractals via domain theory
• Constructive measure theory
• Measure and integration theory. Transl. from the German by Robert B. Burckel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computable version of the Daniell-Stone theorem on integration and linear functionals