Skip to main content
SpringerLink
Log in

Infinite Computations and a Hierarchy in Δ 3

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4497))

Included in the following conference series:

  • 1258 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biegel, R., Gasarch, W.I., Hay, L.: Bounded query classes and the difference hierarchy. Archive for Mathematical Logic, 29(2) (1989)

    Google Scholar 

  2. Biegel, R.: Query-limited reducibilities. Dissertation at Stanford University (1995)

    Google Scholar 

  3. 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

  4. Hamkins, J.D., Lewis, A.: Infinite time turing machines. Journal of Symbolic Logic, 65(2) (2000)

    Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London (1979)

    MATH  Google Scholar 

  6. Siegelmann, H.T., Sontag, E.D.: On the computational power of neural nets. Journal of Computer and System Sciences 50(1), 132–150 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Wiedermann, J., van Leeuwen, J.: Relativistic computers and non-uniform complexity theory (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics Physics and Informatics, Comenius University, 84248 Bratislava, Slovakia

    Branislav Rovan & L’uboš Steskal

Authors
  1. Branislav Rovan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L’uboš Steskal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Institue for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Benedikt Löwe

  3. Dipartimento di Scienze Matematiche ed Informatiche “R. Magari”, University of Siena, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation