This page requires that JavaScript be enabled in your browser.
Learn how »
Computational Complexity Classes, Homotopy Classes and N-machines
James Boyd
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.
Thanks for your feedback.
Channels: Wolfram Virtual Technology Conference 2021
120 videos match your search.