Yhn first seen 1 d ago, last 1 d ago, peak #30
Computability via string diagrams revisited
Original: Monoidal computer I: Basic computability by string diagrams (2012)
A 2012 paper by Peter Selinger-era category theorists, 'Monoidal computer I: Basic computability by string diagrams', is drawing fresh attention. The work reformulates basic computability theory using monoidal categories and string diagrams, an alternative graphical language to Turing machines and lambda calculus. Readers are revisiting the arXiv paper, discussing how diagrammatic approaches can express recursion and universal computation, and debating whether the formalism offers practical insight for modern programming language theory and quantum computing.
Why now: The Hacker News community periodically revives classic papers on category theory and computation, prompting renewed technical discussion.
arXivstring diagramsmonoidal categoriescomputability theory
Rank over time, top of the chart is #1. 7 snapshots from 1 d ago to 1 d ago.
Evidence
- Monoidal computer I: Basic computability by string diagrams (2012) · measurablefunc · 4
API: https://socialmediatrends-api.osmike.com/v1/trends/3575920