|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2012, Number 2, Pages 17–20
(Mi vmumm473)
|
|
|
|
Mathematics
Computable measures coprojection consistent with ordering relation is not necessarily computable
M. A. Raskin Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
An example of two computable probabilistic measures is given on infinite binary sequences such that the two measures are comparable (there exists their coupling that forbids the pairs of symbols with the first member less than the second one), but all such couplings are incomputable.
Key words:
computable probabilistic measures, measure coupling.
Received: 27.09.2010
Citation:
M. A. Raskin, “Computable measures coprojection consistent with ordering relation is not necessarily computable”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2012, no. 2, 17–20; Moscow University Mathematics Bulletin, 67:2 (2012), 61–63
Linking options:
https://www.mathnet.ru/eng/vmumm473 https://www.mathnet.ru/eng/vmumm/y2012/i2/p17
|
Statistics & downloads: |
Abstract page: | 80 | Full-text PDF : | 31 | References: | 23 |
|