Monoidal computer I: Basic computability by string diagrams · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1208.5205/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTMonoidal computer I: Basic computability by string diagrams — HN submissionhttps://news.ycombinator.com/item?id=50198954urn:hackerpapers:submission:1208.5205:50198954Thu, 22 Oct 2026 18:03:57 GMT<p>Monoidal computer I: Basic computability by string diagrams (2012)</p><p></p><p>16 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1208.5205/">Paper and source history</a>. A submission is not an endorsement.</p>cs.LOMonoidal computer I: Basic computability by string diagrams — mentioned by jkhdigitalhttps://news.ycombinator.com/item?id=27960198urn:hackerpapers:mention:1208.5205:27960198Mon, 26 Jul 2021 14:58:35 GMT<p>I&#x27;m a PhD student in computer science, and after spending some time on this subject I&#x27;m pretty well convinced that parts of mathematics and CS are converging towards a more unified foundational framework that will benefit both fields tremendously. In a nutshell, the key challenge is taking the core of complexity theory (which is easy to formalize in terms of state machines) and migrating it into the language(s) of category/type theory (which is much more modular/compositional). A couple interesting recent works in this area: Categorical Complexity…</p><p><a href="https://hackerpaper.kaipfister.de/p/1208.5205/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO