English
Related papers

Related papers: A General Theory of Information and Computation

200 papers

Information theory, though originally developed for communications engineering, provides mathematical tools with broad applications across science. These tools characterize the fundamental limits of data compression and transmission in the…

Information Theory · Computer Science 2026-03-09 Henry Pinkard , Laura Waller

In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…

Quantum Physics · Physics 2018-10-25 Christian Majenz

Feed-forward deep neural networks have been used extensively in various machine learning applications. Developing a precise understanding of the underling behavior of neural networks is crucial for their efficient deployment. In this paper,…

Information Theory · Computer Science 2016-03-22 Pejman Khadivi , Ravi Tandon , Naren Ramakrishnan

Generalized Probabilistic Theories (GPTs) provide a unified framework for describing probabilistic physical theories, encompassing classical and quantum theories as well as hypothetical theories beyond quantum mechanics. Since most GPTs are…

Quantum Physics · Physics 2026-05-14 Koki Ono , Shun Umekawa , Hiroyasu Tajima

Recent breakthroughs in AI capability have been attributed to increasingly sophisticated architectures and alignment techniques, but a simpler principle may explain these advances: memory makes computation universal. Memory enables…

Machine Learning · Computer Science 2024-12-24 Erik Garrison

How does the information flow between different brain regions during various stimuli? This is the question we aim to address by studying complex cognitive paradigms in terms of Information Theory. To assess creativity and the emergence of…

Neurons and Cognition · Quantitative Biology 2025-07-08 Ania Mesa-Rodríguez , Ernesto Estevez-Rams , Holger Kantz

We live in the information age. Claude Shannon, as the father of the information age, gave us a theory of communications that quantified an "amount of information," but, as he pointed out, "no concept of information itself was defined."…

Information Theory · Computer Science 2021-12-06 David Ellerman

The introduced entropy functional's (EF) information measure of random process integrates multiple information contributions along the process trajectories, evaluating both the states' and between states' bound information connections. This…

Adaptation and Self-Organizing Systems · Physics 2014-06-04 Vladimir S. Lerner

We present a framework for quantifying information flow within general quantum processes. For this purpose, we introduce the signaling power of quantum channels and discuss its relevant operational properties. This function supports…

Quantum Physics · Physics 2025-08-08 Leonardo S. V. Santos , Zhen-Peng Xu , Jyrki Piilo , Otfried Gühne

Distributed compression is the task of compressing correlated data by several parties, each one possessing one piece of data and acting separately. The classical Slepian-Wolf theorem (D. Slepian, J. K. Wolf, IEEE Transactions on Inf.…

Computational Complexity · Computer Science 2017-06-27 Marius Zimand

The logic of information flows (LIF) is a general framework in which tasks of a procedural nature can be modeled in a declarative, logic-based fashion. The first contribution of this paper is to propose semantic and syntactic definitions of…

Logic in Computer Science · Computer Science 2022-09-15 Heba Aamer , Bart Bogaerts , Dimitri Surinx , Eugenia Ternovska , Jan Van den Bussche

Building upon the work of Chebyshev, Shannon and Kontoyiannis, it may be demonstrated that Chebyshev's asymptotic result: \begin{equation} \ln N \sim \sum_{p \leq N} \frac{1}{p} \cdot \ln p \end{equation} has a natural information-theoretic…

General Mathematics · Mathematics 2025-05-13 Aidan Rocke

In order to find out the limiting speed of solving a specific problem using computer, this essay provides a method based on information entropy. The relationship between the minimum computational complexity and information entropy change is…

Computational Complexity · Computer Science 2012-03-09 Xue Wu

Analysing how information flows along the layers of a multilayer perceptron is a topic of paramount importance in the field of artificial neural networks. After framing the problem from the point of view of information theory, in this…

Information Theory · Computer Science 2025-10-17 Giuliano Armano

In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…

Logic in Computer Science · Computer Science 2014-09-25 Mathieu Hoyrup , Cristobal Rojas

Networks represent how the entities of a system are connected and can be partitioned differently, prompting ways to compare partitions. Common approaches for comparing network partitions include information-theoretic measures based on…

Social and Information Networks · Computer Science 2024-01-18 Christopher Blöcker , Ingo Scholtes

Humans are the most effective integrators and producers of information, directly and through the use of information-processing inventions. As these inventions become increasingly sophisticated, the substantive role of humans in processing…

Human-Computer Interaction · Computer Science 2015-05-07 Pietro Michelucci

The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…

Dynamical Systems · Mathematics 2009-03-10 Nicolai T A Haydn

Generative AI has achieved remarkable empirical success, but from the perspective of statistics it often remains opaque: its predictions may be accurate, yet the underlying mechanism is difficult to interpret, analyze, and trust. This book…

Machine Learning · Statistics 2026-03-11 Shinto Eguchi

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist