The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem
- Cite this paper as:
- Mycka J., Coelho F., Costa J.F. (2006) The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem. In: Calude C.S., Dinneen M.J., Păun G., Rozenberg G., Stepney S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg
What is the meaning of hypercomputation, the meaning of computing more than the Turing machine? Concrete non-computable functions always hide the halting problem as far as we know. Even the construction of a function that grows faster than any recursive function — the Busy Beaver — a more natural function, hides the halting function, that can easily be put in relation with the Busy Beaver. Is this super-Turing computation concept related only with the halting problem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler construction which reveals the existence of non-computable functions not related with the halting problem. These natural, and the same time, non-computable functions can help to understand the nature of the uncomputable and the purpose, the goal, and the meaning of computing beyond Turing.
Unable to display preview. Download preview PDF.