Skip to main content
SpringerLink
Log in

Inductive Complexity of Goodstein’s Theorem

  • Conference paper
Unconventional Computation and Natural Computation (UCNC 2012)

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

Abstract

We use the recently introduced [1, 2] inductive complexity measure to evaluate the inductive complexity of Goodstein’s Theorem, a statement that is independent from Peano Arithmetic.

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 49.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. Calude, C.S., Calude, E.: The Complexity of Mathematical Problems: An Over-view of Results and Open Problems. CDMTCS Research Report 410 (2011)

    Google Scholar 

  2. Burgin, M., Calude, C.S., Calude, E.: Inductive Complexity Measures for Mathematical Problems. CDMTCS Research Report 416 (2011)

    Google Scholar 

  3. Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic 9, 33–41 (1944)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kirby, L., Paris, L.J.: Accessible independence results for Peano arithmetic. Bulletin of the London Mathematical Society 14, 285–293 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  5. Calude, C.S., Calude, E., Dinneen, M.J.: A new measure of the difficulty of problems. Journal for Multiple-Valued Logic and Soft Computing 12, 285–307 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Calude, C.S., Calude, E.: Evaluating the complexity of mathematical problems. Part 1. Complex Systems 18(3), 267–285 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Calude, C.S., Calude, E.: Evaluating the complexity of mathematical problems. Part 2. Complex Systems 18(4), 387–401 (2010)

    MathSciNet  MATH  Google Scholar 

  8. Burgin, M.: Super-recursive Algorithms. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  9. Burgin, M.: Algorithmic complexity of computational problems. International Journal of Computing & Information Technology 2(1), 149–187 (2010)

    Google Scholar 

  10. Burgin, M.: Measuring Power of Algorithms, Computer Programs, and Information Automata. Nova Science Publishers, New York (2010)

    Google Scholar 

  11. Caicedo, A.: Goodstein’s function. Revista Colombiana de Matemáticas 41, 381–391 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Dinneen, M.J.: A Program-Size Complexity Measure for Mathematical Problems and Conjectures. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) Computation, Physics and Beyond. LNCS, vol. 7160, pp. 81–93. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Calude, C.S., Calude, E., Queen, M.S.: The Complexity of Euler’s Integer Partition Theorem. CDMTCS Research Report 409-revised (2012)

    Google Scholar 

  14. Paris, L.J., Harrington, L.: A Mathematical Incompleteness in Peano Arithmetic. In: Barwise, J. (ed.) Handbook for Mathematical Logic. North-Holland, Amsterdam (1977)

    Google Scholar 

  15. Aaronson, S.: Is P vs NP Formally Independent? The Bulletin of the EATCS 81, 109–136 (2003)

    MathSciNet  MATH  Google Scholar 

  16. Kreisel, G.: On the concepts of completeness and interpretation of formal systems. Fundamenta Mathematicae 39, 103–127 (1952)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. H-Star, Inc., Aventura, FL, USA

    Joachim Hertel

Authors
  1. Joachim Hertel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire d’Informatique, Fondamentale d’Orléan et Départment d’informatique, UFR Sciences, Université d’Orléans, 45067, Orléans Cedex 2, France

    Jérôme Durand-Lose

  2. Department of Mathematics and Statistics, University of South Florida, 33620, Tampa, FL, USA

    Nataša Jonoska

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hertel, J. (2012). Inductive Complexity of Goodstein’s Theorem. In: Durand-Lose, J., Jonoska, N. (eds) Unconventional Computation and Natural Computation. UCNC 2012. Lecture Notes in Computer Science, vol 7445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32894-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32893-0

  • Online ISBN: 978-3-642-32894-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation