Computable measures coprojection consistent with ordering relation is not necessarily computable

DOI10.3103/S0027132212020040MaRDI QIDQ355289zbMATH OpenFDO

Authors Michael Raskin

Publication date 24 July 2013

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

computable probabilistic measuresinfinite binary sequences

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Computability on the probability measures on the Borel sets of the unit interval
• Constructive Equivalence Relations on Computable Probability Measures
• Computability on the probability measures on the Borel sets of the unit interval
• Constructive equivalence relations on computable probability measures
• Computable de Finetti measures

Cites work

• scientific article; zbMATH DE number 1880324 (Why is no real title available?)
• A new class of non-Shannon-type inequalities for entropies
• A non-Shannon-type conditional inequality of information quantities

Cited in

(1)

• Limit Theorems for the Maximal Random Sums

This page was built for publication: Computable measures coprojection consistent with ordering relation is not necessarily computable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355289)