Computable measures coprojection consistent with ordering relation is not necessarily computable

DOI10.3103/S0027132212020040zbMATH Open1283.03077MaRDI QIDQ355289FDOQ355289

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)

Cites Work

• A new class of non-Shannon-type inequalities for entropies
• A non-Shannon-type conditional inequality of information quantities
• Title not available (Why is that?)

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)