论文信息 - A Hierarchy below the Halting Problem for Additive Machines

A Hierarchy below the Halting Problem for Additive Machines

Abstract We answer the question posed by Klaus Meer and Martin Ziegler in “Uncomputability below the Real Halting Problem” whether the set of rational numbers is strictly easier than the Halting Problem with respect to additive machines. We define a hierarchy below the Halting Problem such that the set of rational numbers is strictly easier than the new problems. Moreover, every problem of the hierarchy is strictly easier than its successor.

Christine Gaßner | C. Gaßner

[1] Klaus Meer,et al. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation , 2009, Found. Comput. Math..

[2] Felipe Cucker,et al. Computing over the Reals with Addition and Order: Higher Complexity Classes , 1995, J. Complex..

[3] Pascal Koiran. Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..

[4] Klaus Meer,et al. An explicit solution to Post's Problem over the reals , 2005, J. Complex..

[5] Emil L. Post. Recursively enumerable sets of positive integers and their decision problems , 1944 .

[6] Pascal Koiran,et al. Lower Bounds Are Not Easier over the Reals: Inside PH , 2000, ICALP.

[7] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[8] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.

[9] J. V. Tucker,et al. Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.

[10] Klaus Meer,et al. Uncomputability Below the Real Halting Problem , 2006, CiE.