Monoidal computer I: Basic computability by string diagrams (2012)
3 points by measurablefunc
A new model of computation based on monoidal categories has been developed, aligning with the Church-Turing Thesis and encompassing the same computable functions as traditional models. This approach offers a concise categorical framework, simplifying the complexities found in various implementations while incorporating insights from computational semantics and programming research.