Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic, Language, Information, and Computation

WoLLIC 2012: Logic, Language, Information and Computation pp 1–25Cite as

Formalizing Turing Machines

  • Conference paper

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

Abstract

We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable, machine independent axiomatization of the field.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amadio, R., Asperti, A., Ayache, N., Campbell, B., Mulligan, D., Pollack, R., Régis-Gianas, Y., Coen, C.S., Stark, I.: Certified complexity. Procedia CS 7, 175–177 (2011)

    Article  Google Scholar 

  2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge Univ. Press (2009)

    Google Scholar 

  3. Asperti, A.: The intensional content of rice’s theorem. In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), San Francisco, California, USA, January 7-12, pp. 113–119. ACM (2008)

    Google Scholar 

  4. Asperti, A., Sacerdoti Coen, C.: Some Considerations on the Usability of Interactive Provers. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) AISC 2010. LNCS, vol. 6167, pp. 147–156. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Asperti, A., Avigad, J. (eds.): Special issue on interactive theorem proving and the formalisation of mathematics. Mathematical Structures in Computer Science, vol. 21(4) (2011)

    Google Scholar 

  6. Asperti, A., Ricciotti, W.: A Web Interface for Matita. In: Jeuring, J. (ed.) CICM 2012. LNCS, vol. 7362, pp. 417–421. Springer, Heidelberg (2012)

    Google Scholar 

  7. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., Tassi, E.: Hints in Unification. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 84–98. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., Tassi, E.: The Matita Interactive Theorem Prover. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 64–69. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Trans. Comput. Log. 9(1) (2007)

    Google Scholar 

  10. Aydemir, B.E., Charguéraud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, pp. 3–15. ACM (2008)

    Google Scholar 

  11. Davis, M.: Computability and Unsolvability. Dover Publications (1985)

    Google Scholar 

  12. Stearns, R.E., Hennie, F.C.: Two-tape simulation of multi tape turing machines. Journal of ACM 13(4), 533–546 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fischer, P.C.: On formalisms for turing machines. J. ACM 12(4), 570–580 (1965)

    Article  MATH  Google Scholar 

  14. Hales, T., Gonthier, G., Harrison, J., Wiedijk, F.: A Special Issue on Formal Proof. Notices of the American Mathematical Society 55 (2008)

    Google Scholar 

  15. Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transaction of the American Mathematical Society 117, 285–306 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hennie, F.C.: One-tape, off-line turing machine computations. Information and Control 8(6), 553–578 (1965)

    Article  MathSciNet  Google Scholar 

  17. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley (1979)

    Google Scholar 

  18. Klein, G.: Operating system verification – an overview. Sadhana 34(1), 27–69 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Proc. of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, pp. 42–54 (2006)

    Google Scholar 

  20. Norrish, M.: Mechanised Computability Theory. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 297–311. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Sipser, M.: Introduction to the Theory of Computation. PWS (1996)

    Google Scholar 

  22. Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proc. of the London Math. Society 2(42), 230–265 (1936)

    MathSciNet  Google Scholar 

  23. van Emde Boas, P.: Machine models and simulation. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pp. 1–66 (1990)

    Google Scholar 

  24. Weirich, S., Pierce, B. (eds.): Special issue on the poplmark challenge. Journal of Automated Reasoning (2011) (published online)

    Google Scholar 

  25. Yang, J., Hawblitzel, C.: Safe to the last instruction: automated verification of a type-safe operating system. Commun. ACM 54(12), 123–131 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bologna, Italy

    Andrea Asperti & Wilmer Ricciotti

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wilmer Ricciotti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Luke Ong

  2. Centro de Informática, Universidade Federal de Pernambuco, Av. jornalista Anibal Fernandes, s/n, 50740-560, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asperti, A., Ricciotti, W. (2012). Formalizing Turing Machines. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32621-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32620-2

  • Online ISBN: 978-3-642-32621-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation