Information Complexity of Online Problems

  • Juraj Hromkovič
  • Rastislav Královič
  • Richard Královič
Conference paper

DOI: 10.1007/978-3-642-15155-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6281)
Cite this paper as:
Hromkovič J., Královič R., Královič R. (2010) Information Complexity of Online Problems. In: Hliněný P., Kučera A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg

Abstract

What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is the concept of entropy by Shannon, and the concept of information content of binary strings by Chaitin and Kolmogorov. While these are doubtlessly great research instruments, they are hardly helpful in measuring the amount of information contained in particular objects. In a pursuit to overcome these limitations, we propose the notion of information content of algorithmic problems. We discuss our approaches and their possible usefulness in understanding the basic concepts of informatics, namely the concept of algorithms and the concept of computational complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  • Rastislav Královič
    • 2
  • Richard Královič
    • 1
  1. 1.Department of Computer ScienceETH ZurichSwitzerland
  2. 2.Department of Computer ScienceComenius UniversityBratislavaSlovakia

Personalised recommendations