Complexity theory of real functions
Complexity theory of real functions
Selected papers of the workshop on Topology and completion in semantics
Computability on random variables
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computability on the probability measures on the Borel sets of the unit interval
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Admissible Representations of Limit Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
A computable version of the Daniell-Stone theorem on integration and linear functionals
Theoretical Computer Science
Representing probability measures using probabilistic processes
Journal of Complexity
Admissible Representations of Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
A computable approach to measure and integration theory
Information and Computation
| Hi-index | 5.23 |
We study aspects of computability concerning random events and variables in a computable probability space which fulfills certain computability axioms. To this end, we introduce two multirepresentations of random events and random variables respectively, employing the Frechet-Nikodym metric and the Ky Fan metric. They are shown to be recursively complete in guaranteeing computability of basic operations on random events and random variables. Some natural variations of the multirepresentation of random variables are defined for the integrable variables to explore computability of integration.