Computable measures coprojection consistent with ordering relation is not necessarily computable

DOI10.3103/S0027132212020040zbMath1283.03077MaRDI QIDQ355289

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

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

Cites Work

• Unnamed Item
• A new class of non-Shannon-type inequalities for entropies
• A non-Shannon-type conditional inequality of information quantities

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