Prefix-Like Complexities and Computability in the Limit

  • Alexey Chernov
  • Jürgen Schmidhuber
Conference paper

DOI: 10.1007/11780342_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)
Cite this paper as:
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

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.

Keywords

Kolmogorov complexity limit computability generalized Turing machine non-halting computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Alexey Chernov
    • 1
  • Jürgen Schmidhuber
    • 1
    • 2
  1. 1.IDSIAMannoSwitzerland
  2. 2.TU MunichGarching, MünchenGermany

Personalised recommendations