Abstract

We consider a model of computation where the execution of a program on an input corresponds to calculating a product in a finite monoid. This model has recently been formalized to give an algebraic point of view on certain types of boolean circuits. We focus our discussion on computations over aperiodic monoids: in particular we exhibit examples of such monoids over which it is not possible to count modulo p.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call