Monoidal computer III: A coalgebraic view of computability and complexity
From MaRDI portal
Publication:6285595
DOI10.1007/978-3-030-00389-0_10zbMath1519.68102arXiv1704.04882MaRDI QIDQ6285595
Publication date: 17 April 2017
Complexity of computation (including implicit computational complexity) (03D15) Other nonclassical models of computation (68Q09) Abstract and axiomatic computability and recursion theory (03D75) String diagrams and graphical calculi (18M30)
This page was built for publication: Monoidal computer III: A coalgebraic view of computability and complexity