Any non-affine one-to-one binary gate suffices for computation

TL;DR

The paper demonstrates that any non-affine one-to-one binary gate can be combined to implement fundamental logic gates, enabling the construction of universal computers from such gates.

Contribution

It establishes that a broad class of binary gates, specifically non-affine one-to-one gates, are sufficient for universal computation.

Findings

Any non-affine one-to-one binary gate can produce AND, OR, NOT, and fan-out gates.

Such gates can be wired together to build a general-purpose computer.

This expands the understanding of minimal gate sets needed for computation.

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.