Abstract
The definition of descriptional complexity or algorithmic information in the sense of Kolmogorov or Chaitin is based on two important properties of computable functions, the existence of universal machines and the invariance under the choice of machine. Recently, the notion of descriptional complexity for finite-state computable functions has been introduced by Calude et al. For the latter theory, one cannot rely on the existence of universal machines, but bases the conclusions on an invariance theorem for finite transducers.
This raises the question, which assumptions in algorithmic information theory are actually needed. We answer this question in a general setting, called encoded function space. Without any assumptions regarding encodings of functions and arguments and without any assumptions about computability or computing models, we introduce the notion of complexity. On this basis alone, a general invariance theorem is proved and sufficient conditions are stated for complexity to be computable. Next, universal functions are introduced, defined by pairing functions. It is shown that properties of the pairing functions, that is, of the joint encodings of functions and their inputs, determine the relation between the complexities measured according to different universal functions. In particular, without any other assumptions, for length-bounded or length-preserving pairing functions one can prove that complexity is independent of the choice of the universal function up to an additive constant. Some of the fundamental results of algorithmic information theory are obtained as corollaries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boucher, C.: Leçons sur la théorie des automates mathématiques. Lecture Notes in Operations Research and Mathematical Systems, vol. 46. Springer, Berlin (1971)
Calude, C.S., Jürgensen, H., Zimand, M.: Is independence an exception? Applied Mathematics and Computation 66, 63–76 (1994)
Calude, C.S.: Theories of Computational Complexities. North-Holland, Amsterdam (1988)
Calude, C.S.: Information and Randomness – An Algorithmic Perspective, 2nd edn. Springer, Berlin (2002)
Calude, C.S., Jürgensen, H.: Randomness as an invariant for number representations. In: Maurer, H., Karhumäki, J., Rozenberg, G. (eds.) Results and Trends in Theoretical Computer Science. LNCS, vol. 812, pp. 44–66. Springer, Berlin (1994)
Calude, C.S., Jürgensen, H.: Is complexity a source of incompleteness? Advances in Appl. Math. 35, 1–15 (2005)
Calude, C.S., Salomaa, K., Roblot, T.K.: Finite-state complexity and randomness. Research Report CDMTCS-374, Centre for Discrete Mathematics and Theoretical Computer Science, Auckland, New Zealand (June 2010)
Calude, C.S., Salomaa, K., Roblot, T.K.: Finite-state complexity and the size of transducers. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings of the Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, Saskatoon, Canada, August 8–10, Technical Report 2010-02, 50–61, Department of Computer Science, University of Saskatchewan, Saskatoon (2010); Also published as Electronic Proceedings in Theoretical Computer Science (EPTCS) 31, 38–47 (2010), doi:10.4204/EPTCS.31
Calude, C.S., Salomaa, K., Roblot, T.K.: Finite-state complexity. Theoretical Comput. Sci. 412, 5668–5677 (2011)
Chaitin, G.J.: Algorithmic Information Theory, 3rd edn. Cambridge Tracts in Theoretical Computer Science, vol. 1. Cambridge University Press, Cambridge (1987/1990)
Hoeberechts, M.: On the Foundations of Computability Theory. PhD Thesis, The University of Western Ontario (2009)
Jürgensen, H.: Marks of change in sequences. In: Proceedings of the 37th International Conference on Applications of Mathematics in Engineering and Economics, AMEE 2011, Sozopol, Bulgaria, June 8–13 (to appear, 2011)
Kaufholz, G.: Der programmierbare endliche Automat. Acta Inform. 1, 225–241 (1971/1972)
Kolmogorov, A.N.: Три поДхоДа к опреДелению понятия «количество информации» Three approaches for defining the concept of ’information quantity’. Problemy Peredachi Informatsii 1(1), 3–11 (1965); English translation: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1, 1–7 (1966); Also published as: Three approaches to the definition of the notion of amount of information. In: [18], pp. 184–193
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Berlin (1997)
Ring, H.: Universelle erkennende Automaten für reguläre Sprachen. Dissertation, Universität Karlsruhe (TH) (1973)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Shiryayev, A.N. (ed.): Selected Works of A. N. Kolmogorov, III. Kluwer Academic Publishers, Dordrecht (1993); Annotated translation of Теория информациии теория алгоритмов, Nauka, Moscow (1987); translated by A.B. Sossinsky
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jürgensen, H. (2012). Invariance and Universality of Complexity. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds) Computation, Physics and Beyond. WTCS 2012. Lecture Notes in Computer Science, vol 7160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27654-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-27654-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27653-8
Online ISBN: 978-3-642-27654-5
eBook Packages: Computer ScienceComputer Science (R0)