Skip to main content
SpringerLink
Log in

Infinite Time Computable Model Theory

  • Chapter
New Computational Paradigms

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Vinay Deolalikar, Joel David Hamkins, and Ralf-Dieter Schindler. P = NP ∩ co-NP for infinite time turing machines. Journal of Logic and Computation, 15(5):577-592, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  2. Yuri L. Ershov, Sergey S. Goncharov, Anil Nerode, and Jeffrey B. Remmel, editors. Handbook of Recursive Mathematics, Volume 1: Recursive Model Theory, volume 138 of Studies in Logic and the Foundations of Mathematics. Elsevier, 1998.

    Google Scholar 

  3. Joel David Hamkins. Infinite time turing machines. Minds and Machines, 12(4):521-539,2002. (special issue devoted to hypercomputation).

    Google Scholar 

  4. Joel David Hamkins. Infinitary computability with infinite time Turing machines. In Barry S. Cooper and Benedikt Löwe, editors, New Computational Paradigms, volume 3526 of LNCS, Amsterdam, June 8-12 2005. CiE, Springer-Verlag.

    Google Scholar 

  5. Joel David Hamkins and Andy Lewis. Infinite time Turing machines. J. Symbolic Logic, 65(2):567-604, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. Joel David Hamkins and Andy Lewis. Post’s problem for supertasks has both positive and negative solutions. Archive for Mathematical Logic, 41(6):507-523, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  7. Joel David Hamkins and Daniel Seabold. Infinite time Turing machines with only one tape. Mathematical Logic Quarterly, 47(2):271-287, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  8. Joel David Hamkins and Philip Welch. P f= NP f for almost all f . Mathematical Logic Quarterly, 49(5):536-540, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  9. Thomas Jech. Set Theory. Springer Monographs in Mathematics, 3rd edition, 2003.

    Google Scholar 

  10. Peter Koepke. Turing computations on ordinals. Bulletin of Symbolic Logic, 11(3):377-397,2005.

    Article  MATH  Google Scholar 

  11. Benedikt Löwe. Revision sequences and computers with an infinite amount of time.Logic Comput., 11(1):25-40, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  12. Philip Welch. Eventually infinite time Turing machine degrees: Infinite time decidable reals. Journal of Symbolic Logic, 65(3):1193-1203, 2000.

    Article  MathSciNet  Google Scholar 

  13. Philip Welch. The lengths of infinite time Turing machine computations. Bulletin of the London Mathematical Society, 32(2):129-136, 2000.

    Article  MathSciNet  Google Scholar 

  14. Philip Welch. The transfinite action of 1 tape Turing machines. In Barry S. Cooper and Benedikt Löwe, editors, New Computational Paradigms, volume 3526 of LNCS, Amsterdam, June 8-12 2005. CiE, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics, The College of Staten Island of The City University of New York, 10314, Staten Island, NY, USA

    Joel David Hamkins

  2. Mathematics, Queens College of The City University of New York, 11367, New York, NY, USA

    Russell Miller

  3. Department of Mathematics, Hofstra University, 11549-1030, Hempstead, NY, USA

    Daniel Seabold & Steve Warner

Authors
  1. Joel David Hamkins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Russell Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Seabold
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Steve Warner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, Netherlands

    Benedikt Löwe

  3. Università di Siena, Pian dei Mantellini 44, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Hamkins, J.D., Miller, R., Seabold, D., Warner, S. (2008). Infinite Time Computable Model Theory. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) New Computational Paradigms. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68546-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-68546-5_20

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-36033-1

  • Online ISBN: 978-0-387-68546-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation