Application of Algorithmic Manifold to Exponential Time
Takuya Yabu · 2017
In the previous paper, I defined algorithmic manifolds simulating polynomial-time algorithms, and I showed topological properties for P problem and NP problem and that NP problem can be transformed into deterministic Turing machine problem. In this paper, I define algorithmic manifolds simulating exponential-time algorithms and, I show topological properties for EXPTIME problem and NEXPTIME problem. I also discuss the relationship between NEXPTIME and deterministic Turing machines.