Coalgebraic Tools for Randomness-Conserving Protocols
Logic in Computer Science
2021-10-26 v2 Formal Languages and Automata Theory
Information Theory
math.IT
Probability
Abstract
We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. We provide basic tools that allow efficient protocols to be constructed in a compositional way and analyzed in terms of the tradeoff between state and loss of entropy. We show how to use these tools to construct various entropy-conserving reductions between processes.
Cite
@article{arxiv.1807.02735,
title = {Coalgebraic Tools for Randomness-Conserving Protocols},
author = {Dexter Kozen and Matvey Soloviev},
journal= {arXiv preprint arXiv:1807.02735},
year = {2021}
}
Comments
37 pages, including references. In submission to J. Logical and Algebraic Methods in Programming