zss.pdf (6.37 MB)
ZSS: Zipper logic revisited
Can we compute with tangles and Reidemeister moves? I explain where this problem comes from, why it is different than the usual way of using tangles in computation and then I propose the Zip-Slip-Smash (ZSS) graph rewriting system, which is an improvement of zipper logic arXiv:1405.6095, and prove that it allows universal computation using tangles and zippers, via directed Interaction Combinators.