Abstract
We present a hierarchy of families between the Σ 2 and Δ 3 levels of the arithmetic hierarchy. The structure of the top five levels of this hierarchy is in some sense similar to the structure of the Chomsky hierarchy, while the bottom levels are reminiscent of the bounded oracle query hierarchy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Biegel, R., Gasarch, W.I., Hay, L.: Bounded query classes and the difference hierarchy. Archive for Mathematical Logic, 29(2) (1989)
Biegel, R.: Query-limited reducibilities. Dissertation at Stanford University (1995)
Etesi, G., Németi, I.: Non-turing computations via malament-hogarth space-times. Int. J. Theor. Phys. 41 (2002), see also: http://arXiv.org/abs/gr-qc/0104023
Hamkins, J.D., Lewis, A.: Infinite time turing machines. Journal of Symbolic Logic, 65(2) (2000)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London (1979)
Siegelmann, H.T., Sontag, E.D.: On the computational power of neural nets. Journal of Computer and System Sciences 50(1), 132–150 (1995)
Wiedermann, J., van Leeuwen, J.: Relativistic computers and non-uniform complexity theory (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rovan, B., Steskal, L. (2007). Infinite Computations and a Hierarchy in Δ 3 . In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)