English
Related papers

Related papers: Information Width

200 papers

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's…

Information Theory · Computer Science 2008-09-17 Peter D. Grunwald , Paul M. B. Vitanyi

A unified combinatorial definition of the information content and entropy of different types of patterns, compatible with the traditional concepts of information and entropy, going beyond the limitations of Shannon information interpretable…

Information Theory · Computer Science 2025-01-22 Zsolt Pocze

The deterministic notions of capacity and entropy are studied in the context of communication and storage of information using square-integrable, bandlimited signals subject to perturbation. The $(\epsilon,\delta)$-capacity, that extends…

Information Theory · Computer Science 2015-04-21 Massimo Franceschetti , Taehyung J. Lim

Symmetry of information establishes a relation between the information that x has about y (denoted I(x : y)) and the information that y has about x (denoted I(y : x)). In classical information theory, the two are exactly equal, but in…

Information Theory · Computer Science 2012-06-25 Marius Zimand

Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory where one…

Information Theory · Computer Science 2015-04-21 Alexander Shen

The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…

Computational Complexity · Computer Science 2007-05-23 Paul Vitanyi

We survey and introduce concepts and tools located at the intersection of information theory and network biology. We show that Shannon's information entropy, compressibility and algorithmic complexity quantify different local and global…

Molecular Networks · Quantitative Biology 2015-12-14 Hector Zenil , Narsis A. Kiani , Jesper Tegnér

This article introduces the physics of information in the context of molecular biology and genomics. Entropy and information, the two central concepts of Shannon's theory of information and communication, are often confused with each other…

Biomolecules · Quantitative Biology 2007-05-23 Christoph Adami

We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…

Logic · Mathematics 2008-01-03 Marie Ferbus-Zanda , Serge Grigorieff

I discuss several aspects of information theory and its relationship to physics and neuroscience. The unifying thread of this somewhat chaotic essay is the concept of Kolmogorov or algorithmic complexity (Kolmogorov Complexity, for short).…

General Physics · Physics 2007-05-23 Giulio Ruffini

In this paper, we revisit a central concept in Kolmogorov complexity in which one would equate program-size complexity with information content. Despite the fact that Kolmogorov complexity has been widely accepted as an objective measure of…

Information Theory · Computer Science 2017-10-19 Fouad B. Chedid

In this paper, we present some results on information, complexity and entropy as defined below and we discuss their relations with the Kolmogorov-Sinai entropy which is the most important invariant of a dynamical system. These results have…

Dynamical Systems · Mathematics 2019-08-17 Vieri Benci , Claudio Bonanno , Stefano Galatolo , Giulia Menconi , Federico Ponchio

We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally different. We discuss and relate the basic notions of both theories:…

Information Theory · Computer Science 2020-07-21 Peter Grunwald , Paul Vitanyi

We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…

Logic in Computer Science · Computer Science 2010-10-20 Marie Ferbus-Zanda , Serge Grigorieff

This article serves as a brief introduction to the Shannon information theory. Concepts of information, Shannon entropy and channel capacity are mainly covered. All these concepts are developed in a totally combinatorial flavor. Some issues…

Information Theory · Computer Science 2021-04-26 Ricky X. F. Chen

"Information Processing" is a recently launched buzzword whose meaning is vague and obscure even for the majority of its users. The reason for this is the lack of a suitable definition for the term "information". In my attempt to amend this…

Artificial Intelligence · Computer Science 2013-03-12 Emanuel Diamant

Information is a precise concept that can be defined mathematically, but its relationship to what we call "knowledge" is not always made clear. Furthermore, the concepts "entropy" and "information", while deeply related, are distinct and…

Adaptation and Self-Organizing Systems · Physics 2016-03-03 Christoph Adami

In the 21st century, many of the crucial scientific and technical issues facing humanity can be understood as problems associated with understanding, modelling, and ultimately controlling complex systems: systems comprised of a large number…

Information Theory · Computer Science 2025-01-20 Thomas F. Varley

We develop a general formalism for representing and understanding structure in complex systems. In our view, structure is the totality of relationships among a system's components, and these relationships can be quantified using information…

Statistical Mechanics · Physics 2014-09-17 Benjamin Allen , Blake C. Stacey , Yaneer Bar-Yam

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as…

Information Theory · Computer Science 2011-11-29 David Balduzzi
‹ Prev 1 2 3 10 Next ›