Article contents
Abelian Logic Gates
Published online by Cambridge University Press: 13 March 2019
Abstract
An abelian processor is an automaton whose output is independent of the order of its inputs. Bond and Levine have proved that a network of abelian processors performs the same computation regardless of processing order (subject only to a halting condition). We prove that any finite abelian processor can be emulated by a network of certain very simple abelian processors, which we call gates. The most fundamental gate is a toppler, which absorbs input particles until their number exceeds some given threshold, at which point it topples, emitting one particle and returning to its initial state. With the exception of an adder gate, which simply combines two streams of particles, each of our gates has only one input wire, which sends letters (‘particles’) from a unary alphabet. Our results can be reformulated in terms of the functions computed by processors, and one consequence is that any increasing function from ℕk to ℕℓ that is the sum of a linear function and a periodic function can be expressed in terms of (possibly nested) sums of floors of quotients by integers.
MSC classification
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2019
Footnotes
The second author is supported by NSF grant DMS-1455272 and a Sloan Fellowship.
The third author is supported by NSF grant DMS-1162172.
References
- 1
- Cited by