A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Probabilistic non-determinism
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Power domains and iterated function systems
Information and Computation
A computational model for metric spaces
Theoretical Computer Science
Domain Theory in Stochastic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Measuring the Probabilistic Powerdomain
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
The regular spaces with countably based models
Theoretical Computer Science - Topology in computer science
Measuring the probabilistic powerdomain
Theoretical Computer Science - Special issue on automata, languages and programming
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
A computable approach to measure and integration theory
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
An Application of Martin-Löf Randomness to Effective Probability Theory
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
An intrinsic characterization of approximate probabilistic bisimilarity
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Hi-index | 0.00 |
We construct an approximating chain of simple valuations on the upper space of a compact metric space whose lub is a given probability measure on the metric space. We show that whenever a separable metric space is homeomorphic to a G δ subset of an ω-continuous dcpo equipped with its Scott topology, the space of probability measures of the metric space equipped with the weak topology is homeomorphic with a subset of the maximal elements of the probabilistic power domain of the ω-continuous dcpo. Given an effective approximation of a probability measure by an increasing chain of normalised valuations on the upper space of a compact metric space, we show that the expected value of any Hölder continuous function on the space can be obtained up to any given accuracy. We present a novel application in computing integrals in dynamical systems. We obtain an algorithm to compute the expected value of any Hölder continuous function with respect to the unique invariant measure of the Feigenbaum map in the periodic doubling route to chaos.