Skip to main content
SpringerLink
Log in

Prefix-Like Complexities and Computability in the Limit

  • Conference paper
Book cover Logical Approaches to Computational Barriers (CiE 2006)

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

Included in the following conference series:

  • 954 Accesses

Abstract

Computability in the limit represents the non-plus-ultra of constructive describability. It is well known that the limit computable functions on naturals are exactly those computable with the oracle for the halting problem. However, prefix (Kolmogorov) complexities defined with respect to these two models may differ. We introduce and compare several natural variations of prefix complexity definitions based on generalized Turing machines embodying the idea of limit computability, as well as complexities based on oracle machines, for both finite and infinite sequences.

This work was sponsored by SNF grant 200020-107590/1.

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. Asarin, E., Collins, P.: Noisy Turing Machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1031–1042. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Becher, V., Figueira, S.: Kolmogorov Complexity for Possibly Infinite Computations. J. Logic, Language and Information 14(2), 133–148 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Becher, V., Figueira, S., Nies, A., Picchi, S.: Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Logic 46(1), 51–64 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burgin, M.S.: Inductive Turing Machines. Soviet Math. Doklady 27(3), 730–734 (1983)

    MATH  Google Scholar 

  5. Calude, C.S., Pavlov, B.: Coins, Quantum Measurements, and Turing’s Barrier. Quantum Information Processing 1(1–2), 107–127 (2002)

    Article  MathSciNet  Google Scholar 

  6. Case, J., Jain, S., Sharma, A.: On Learning Limiting Programs. In: Proc. of COLT 1992, pp. 193–202. ACM Press, New York (1992)

    Google Scholar 

  7. Chaitin, G.J.: A Theory of Program Size Formally Identical to Information Theory. Journal of the ACM 22, 329–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chernov, A., Schmidhuber, J.: Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines. Technical Report IDSIA-11-05, Manno (Lugano), Switzerland (2005)

    Google Scholar 

  9. Durand, B., Shen, A., Vereshchagin, N.: Descriptive Complexity of Computable Sequences. Theoretical Computer Science 271(1–2), 47–58 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Etesi, G., Nemeti, I.: Non-Turing Computations via Malament-Hogarth Space-Times. International Journal of Theoretical Physics 41, 341 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Freivald, R.V.: Functions Computable in the Limit by Probabilistic Machines. In: Proc. of the 3rd Symposium on Mathematical Foundations of Computer Science, pp. 77–87. Springer, Heidelberg (1975)

    Chapter  Google Scholar 

  12. Gács, P.: On the Relation between Descriptional Complexity and Algorithmic Probability. Theoretical Computer Science 22(1–2), 71–93 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gold, E.M.: Limiting Recursion. J. Symbolic Logic 30(1), 28–46 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hayashi, S., Nakata, M.: Towards Limit Computable Mathematics. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 125–144. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Kolmogorov, A.N.: Three Approaches to the Quantitative Definition of Information. Problems of Information Transmission 1(1), 1–11 (1965)

    MathSciNet  MATH  Google Scholar 

  16. Levin, L.A.: Laws of Information (Nongrowth) and Aspects of the Foundation of Probability Theory. Problems of Information Transmission 10(3), 206–210 (1974)

    Google Scholar 

  17. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  18. Poland, J.: A Coding Theorem for Enumerating Output Machines. Information Processing Letters 91(4), 157–161 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schmidhuber, J.: Algorithmic Theories of Everything. Technical Report IDSIA-20-00, quant-ph/0011122, IDSIA, Manno (Lugano), Switzerland (2000)

    Google Scholar 

  20. Schmidhuber, J.: Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit. International J. Foundations of Computer Science 13(4), 587–612 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  21. Shoenfield, J.R.: On Degrees of Unsolvability. Annals of Mathematics 69, 644–653 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  22. Simpson, S.G.: Degrees of Unsolvability: A Survey of Results. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 631–652. North-Holland, Amsterdam (1977)

    Chapter  Google Scholar 

  23. Uspensky, V.A., Vereshchagin, N.K., Shen, A.: Lecture Notes on Kolmogorov Complexity (unpublished), http://lpcs.math.msu.su/~ver/kolm-book

Download references

Author information

Authors and Affiliations

  1. IDSIA, Galleria 2, 6928, Manno, Switzerland

    Alexey Chernov & Jürgen Schmidhuber

  2. TU Munich, Boltzmannstr. 3, 85748, Garching, München, Germany

    Jürgen Schmidhuber

Authors
  1. Alexey Chernov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Schmidhuber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Swansea, United Kingdom

    Arnold Beckmann

  2. Department of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, UK

    Ulrich Berger

  3. Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, Amsterdam, TV, The Netherlands

    Benedikt Löwe

  4. School of Physical Sciences, Swansea University, Singleton Park, SA2 8PP, Swansea, Wales, United Kingdom

    John V. Tucker

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chernov, A., Schmidhuber, J. (2006). Prefix-Like Complexities and Computability in the Limit. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_9

Download citation

  • DOI: https://doi.org/10.1007/11780342_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35466-6

  • Online ISBN: 978-3-540-35468-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation