
TL;DR
This paper presents an algebraic perspective on computation, viewing it as a morphism from a finite universal semigroup, emphasizing the structural and abstract nature of computational processes.
Contribution
It introduces a novel algebraic framework for understanding computation, connecting it to universal semigroup theory and morphisms.
Findings
Computation can be modeled as morphisms in algebraic structures.
The algebraic view unifies various computational models under a common framework.
Provides a foundation for further algebraic analysis of computational processes.
Abstract
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Quantum Computing Algorithms and Architecture
