Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
In: Cîrstea, C., Knapp, A
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Adjoining countable infinite tensor products to FinStoch yields exactly the category of locally constant Markov kernels on finite sets plus the Cantor space, and lifts the complete axiomatisation of binary stochastic matrices to this continuous setting.
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.
citing papers explorer
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
-
Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction
Adjoining countable infinite tensor products to FinStoch yields exactly the category of locally constant Markov kernels on finite sets plus the Cantor space, and lifts the complete axiomatisation of binary stochastic matrices to this continuous setting.
-
A Diagrammatic Basis for Computer Programming
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.