Reversible k-valued logic circuits are finitely generated for odd k
Emerging Technologies
2016-04-07 v1 Rings and Algebras
Quantum Physics
Abstract
In his 2003 paper "Towards an algebraic theory of Boolean circuits", Lafont notes that the class of reversible circuits over a set of k truth values is finitely generated when k is odd. He cites a private communication for the proof. The purpose of this short note is to make the content of that communication available.
Keywords
Cite
@article{arxiv.1604.01646,
title = {Reversible k-valued logic circuits are finitely generated for odd k},
author = {Peter Selinger},
journal= {arXiv preprint arXiv:1604.01646},
year = {2016}
}
Comments
3 pages