Admissible Representations of Probability Measures

Electronic Notes in Theoretical Computer Science - Tập 167 - Trang 61-78 - 2007
Matthias Schröder1
1LFCS, School of Informatics, University of Edinburgh, Edinburgh, United Kingdom

Tài liệu tham khảo

Cohn, 1993 Gierz, 2003 Jones, C., Probabilistic Non-Determinism, Ph.D. Thesis, University of Edinburgh, 1989 Kingman, 1966 Lawler, 1976 Lawson, 2004, Domains, integration and 'positive analysis', Math. Struct. in Comp. Science, 14, 815, 10.1017/S0960129504004372 Schröder, 2002, Extended Admissibility, Theoretical Computer Science, 284, 519, 10.1016/S0304-3975(01)00109-8 Schröder, M., Admissible Representations for Continuous Computations, Ph.D. Thesis, Informatik–Berichte 299, FernUniversität Hagen, 2003 Schröder, M., and A. Simpson, Representing Probability Measures using Probabilistic Processes, to appear in Journal of Complexity, 2006 Smyth, 1992, Topology, Vol. 1, 641 Weihrauch, 1999, Computability on the probability measures on the Borel sets of the unit interval, Theoretical Computer Science, 219, 421, 10.1016/S0304-3975(98)00298-9 Weihrauch, 2000