Prime Clocks

TL;DR

This paper introduces prime clocks, a novel computational primitive based on prime numbers, capable of representing any Boolean function with a parallelizable algorithm, establishing new links between number theory and computation.

Contribution

It proposes prime clocks and prime clock sums as new computational primitives that enable parallel computation of Boolean functions, unlike traditional logic gates.

Findings

Prime clocks generate an infinite abelian group with finite subgroups.

Any Boolean function can be represented using a finite prime clock sum.

A parallelizable algorithm for computing Boolean functions using prime clocks is provided.

Abstract

Physical implementations of digital computers began in the latter half of the 1930's and were first constructed from various forms of logic gates. Based on the prime numbers, we introduce prime clocks and prime clock sums, where the clocks utilize time and act as computational primitives instead of gates. The prime clocks generate an infinite abelian group, where for each n, there is a finite subgroup S such that for each Boolean function f : {0, 1}^n --> {0, 1}, there exists a finite prime clock sum in S that can represent and compute f. A parallelizable algorithm, implemented with a finite prime clock sum, is provided that computes f. In contrast, the negation, conjunction, and disjunction operations generate a Boolean algebra. In terms of computation, Boolean circuits computed with logic gates NOT, AND, OR have a depth. This means that a completely parallel computation of Boolean functions is not possible with these gates. Overall, some new connections between number theory, Boolean functions and computation are established.