Translatability Problem of Geodesics on Algorithmic Manifolds
Keyword(s):
In the previous paper, I define algorithmic manifolds simulating deterministic Turing machines and by determining the start point and end point of the algorithm in a P problem on the algorithmic manifold, there is the optimal algorithm as the length minimizing geodesic between the start point and the end point, and the length minimizing geodesic can be derived by determining the start point and the end point also in a NP problem. In this paper, I show that the possibility of translating algorithms from geodesics on algorithmic manifolds is equivalent to the halting problem of Turing machine. I will also discuss the problems of translating from geodesics using existing algorithms.
2017 ◽
Keyword(s):
1992 ◽
Vol 06
(02n03)
◽
pp. 211-225
◽
2019 ◽
Vol 475
(2226)
◽
pp. 20180767
◽
2001 ◽
Vol 15
(07)
◽
pp. 1143-1165
◽
2001 ◽
Vol 63
(3)
◽
pp. 623-639
◽
Keyword(s):