Skip to main content
SpringerLink
Log in

How Powerful Are Infinite Time Machines?

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Included in the following conference series:

  • 442 Accesses

Abstract

We study the power of finite machines with infinite time to complete their task. To do this, we define a variant to Wojciechowski automata, investigate their recognition power, and compare them to infinite time Turing machines. Furthermore, using this infinite time, we analyse the ordinals comprehensible by such machines and discover that one can in fact go beyond the recursive realm. We conjecture that this is somehow already the case with Wojciechowski automata.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. N. Bedon, Finite automata and ordinals, Theoretical Computer Science 156 (1996), 119–144.

    Article  MATH  MathSciNet  Google Scholar 

  2. -, Automata, semigroups and recognizability of words on ordinals, International Journal of Algebra and Computation 8 (1998), 1–21.

    Article  MathSciNet  Google Scholar 

  3. -, Langages reconnaissables de mots indexés par des ordinaux, Ph.D. thesis, Université de Marne-la-Vallée, 1998.

    Google Scholar 

  4. N. Bedon and O. Carton, An Eilenberg theorem for words on countable ordinals, Latin’98: Theoretical Informatics (Cláudio L. Lucchesi and Arnaldo V. Moura, eds.), Lect. Notes in Comput. Sci., vol. 1380, Springer-Verlag, 1998, pp. 53–64.

    Google Scholar 

  5. J. R. Büchi, On a decision method in the restricted second-order arithmetic, Logic, Methodology, and Philosophy of Science: Proc. 1960 Intern. Congr., Stanford University Press, 1962, pp. 1–11.

    Google Scholar 

  6. -, Decision methods in the theory of ordinals, Bulletin of the American Mathematical Society 71 (1965), 767–770.

    Article  MATH  MathSciNet  Google Scholar 

  7. Y. Choueka, Finite automata, definable sets and regular expressions over ω n-tapes, Journal of Computer and System Sciences 17 (1978), 81–97.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. D. Hamkins and A. Lewis, Infinite time Turing machines, Journal of Symbolic Logic 65 (2000), no. 2, 567–604.

    Article  MATH  MathSciNet  Google Scholar 

  9. G. Lafitte, How powerful are infinite time machine?, RR 2001-16, LIP, Ecole Normale Supérieure de Lyon, March 2001, ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2001/.

  10. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9 (1966), 521–530.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. E. Müller, Infinite sequences and finite machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (Chicago, Illinois), IEEE, October 1963, pp. 3–16.

    Chapter  Google Scholar 

  12. D. Perrin, Recent results on automata and infinite words, Mathematical foundations of computer science (Berlin) (M. P. Chytil and V. Koubek, eds.), Lecture Notes in Computer Science, vol. 176, Springer-Verlag, 1984, pp. 134–148.

    Google Scholar 

  13. D. Perrin and J.-E. Pin, Mots infinis, to appear, 1997.

    Google Scholar 

  14. P. Welch, The length of infinite time Turing machine computations, Bulletin of the London Mathematical Society 32 (2000), no. 2, 129–136.

    Article  MATH  MathSciNet  Google Scholar 

  15. J. Wojciechowski, Classes of transfinite sequences accepted by finite automata, Annales Societatis Mathematicæ Polonæ, Fundamenta Informaticæ VII (1984), no. 2, 191–223.

    MathSciNet  Google Scholar 

  16. -, Finite automata on transfinite sequences and regular expressions, Annales Societatis Mathematicæ Polonæ, Fundamenta Informaticæ VIII (1985), no. 3–4, 379–396.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de l’Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, 46 allée d’Italie, 69364, Lyon Cedex 07, France

    Grégory Lafitte

Authors
  1. Grégory Lafitte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lafitte, G. (2001). How Powerful Are Infinite Time Machines?. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation