Information Complexity of Online Problems
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.
KeywordsInformation Content Problem Instance Competitive Ratio Online Algorithm Information Complexity
Unable to display preview. Download preview PDF.
- 1.Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: Online algorithms with advice. Technical Report 614, ETH Zürich (2009)Google Scholar
- 7.Hromkovič, J.: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms, Texts in Theoretical Computer Science. An EATCS Series. Springer, New York (2005)Google Scholar
- 11.Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2(42), 230–265 (1936)Google Scholar