Information Efficiency
From MaRDI portal
Abstract: Kolmogorov argued that the concept of information exists also in problems with no underlying stochastic model (as Shannon's information representation) for instance, the information contained in an algorithm or in the genome. He introduced a combinatorial notion of entropy and information conveyed by a binary string about the unknown value of a variable . The current paper poses the following questions: what is the relationship between the information conveyed by about to the description complexity of ? is there a notion of cost of information ? are there limits on how efficient conveys information ? To answer these questions Kolmogorov's definition is extended and a new concept termed {em information width} which is similar to -widths in approximation theory is introduced. Information of any input source, e.g., sample-based, general side-information or a hybrid of both can be evaluated by a single common formula. An application to the space of binary functions is considered.
Recommendations
- On the Combinatorial Representation of Information
- scientific article; zbMATH DE number 726918
- scientific article; zbMATH DE number 194098
- scientific article; zbMATH DE number 3623432
- Measuring information beyond communication theory. Some probably useful and some almost certainly useless generalizations
Cited in
(6)- scientific article; zbMATH DE number 5811184 (Why is no real title available?)
- On the complexity of binary samples
- scientific article; zbMATH DE number 5852882 (Why is no real title available?)
- Applying information theory estimations to the problem of the choice of counteraction strategy in terms of information war
- scientific article; zbMATH DE number 726918 (Why is no real title available?)
- On the Combinatorial Representation of Information
This page was built for publication: Information Efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448797)