Probabilistic non-determinism
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
Theoretical Computer Science
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
Representing probability measures using probabilistic processes
Journal of Complexity
Notions of Probabilistic Computability on Represented Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Applications of Effective Probability Theory to Martin-Löf Randomness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computability on random events and variables in a computable probability space
Theoretical Computer Science
| Hi-index | 0.00 |
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 Theory of Effectivity. This gives rise to a natural representation of the set M(X) of Borel probability measures on X. We compare this representation to a canonically constructed representation which encodes a Borel probability measure as a lower semicontinuous function from the open sets to the unit interval. This canonical representation turns out to be admissible with respect to the weak topology on M(X). Moreover, we prove that for countably based topological spaces X the representation via probabilistic processes is equivalent to the canonical representation and thus admissible with respect to the weak topology on M(X).