  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.
