Computation and the Periodic Table
By now there is an extensive network of interlocking analogies between physics, topology, logic and computer science, which can be seen most easily by comparing the roles that symmetric monoidal closed categories play in each subject. However, symmetric monoidal categories are just the n = 1, k = 3 entry of a hypothesized
â€œperiodic tableâ€ of ktuply monoidal ncategories. This raises the question of how these analogies extend. We present some thoughts on this question, focusing on how monoidal closed 2categories might let us understand the lambda calculus more deeply.
Link to the talk
via The nCategory Café

Recent comments
10 hours 54 min ago
12 hours 8 min ago
12 hours 18 min ago
13 hours 16 min ago
13 hours 35 min ago
16 hours 2 min ago
17 hours 30 min ago
19 hours 5 min ago
20 hours 44 min ago
1 day 6 hours ago