Wolfram Screencast & Video Gallery

This page requires that JavaScript be enabled in your browser.
Learn how »

Computational Complexity Classes, Homotopy Classes and N-machines

This presentation examines possible correspondence between computational complexity classes in computational graphs and higher homotopy classes between computability paths via the application of two methods: category theory and Homotopy Type Theory.

Was this video helpful?