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.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.