2017-12-18

[public] 55.5K views, 4.52K likes, 10.0 dislikes audio only

suckerpinch

This lecture is an addendum to my video about Anagraphs, which you should watch first (or only). I do two proofs by reduction: One that the "generalized kerning" problem is undecidable, and one that the "generalized anagraphing" problem is decidable. The first proof uses turing machines, and the second a fragment of linear logic. I try to explain both without assuming any prior knowledge, but there's only so much you can squeeze into 51 minutes.

Anagraphs video: /youtube/video/qTBAW-Eh0tM