Sciweavers

MFCS
2010
Springer

Information Complexity of Online Problems

13 years 2 months ago
Information Complexity of Online Problems
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.
Juraj Hromkovic, Rastislav Královic, Richar
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where MFCS
Authors Juraj Hromkovic, Rastislav Královic, Richard Královic
Comments (0)