Effective Brenier Theorem

DOI10.1145/2933575.2933596zbMATH Open1401.03085OpenAlexW2530404263MaRDI QIDQ4635935FDOQ4635935

Authors: Alex Galicki 

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933575.2933596

Recommendations

• Effective randomness for computable probability measures
• On elementary computability-theoretic properties of algorithmic randomness
• On analogues of the Church-Turing thesis in algorithmic randomness
• Computable Measure Theory and Algorithmic Randomness
• Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness
• Coarse reducibility and algorithmic randomness
• Effective choice and boundedness principles in computable analysis
• Effective Choice and Boundedness Principles in Computable Analysis
• Randomness extraction in computability theory
• scientific article; zbMATH DE number 817189

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

This page was built for publication: Effective Brenier Theorem

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