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.