The Fastest Way of Solving Travelling Salesmen Problems

In two thousand four paper, you describe a gatol machines on programmes that rerite themselves. But do you see these self referential programes being successful in the near term? Ye. We had these different types ofa fundamental research how to build universal problems over one basically exploiting proof serch and things like that. You need to come up with asymtorically optimal, theoretically optimal self improvers and problem solvers. One has to admit that through this proof search comes in an adative, constant, an overhead,. An addactive overhead that vanishes in comparison to what you have to do to solve large problems.