Abstract
We develop the theory of H-computability, which is strictly more powerful than Turing computability. (”H” stands for ”Hilbert”, since we can decide Peano Arithmetic in H-computation theory). Hcomputation is Turing computation plus an intuitive principle which goes back to Euclid and is called here the ”Geometric Principle”. Turing degrees are shown to be a natural complexity measure for H-computable objects.
Cite
CITATION STYLE
da Costa, N. C. A., & Doria, F. A. (1996). H-computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1159, p. 238). Springer Verlag. https://doi.org/10.1007/3-540-61859-7_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
