Any non-affine one-to-one binary gate suffices for computation
Quantum Physics
2015-04-15 v1 Other Computer Science
Abstract
Any non-affine one-to-one binary gate can be wired together with suitable inputs to give AND, OR, NOT and fan-out gates, and so suffices to construct a general-purpose computer.
Cite
@article{arxiv.1504.03376,
title = {Any non-affine one-to-one binary gate suffices for computation},
author = {Seth Lloyd},
journal= {arXiv preprint arXiv:1504.03376},
year = {2015}
}
Comments
7 pages, plain TeX, 1992 Los Alamos Alamos preprint number LA-UR-92-996. Shows that any non-affine reversible binary logic gate is universal