COMPLEXITY, INFORMATION, ENERGY

DOI10.1142/S0129054108005954MaRDI QIDQ3526535zbMATH OpenOpenAlexFDO

Authors Helmut Jürgensen

Publication date 25 September 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054108005954

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites work

• A broader view on the limitations of information processing and communication by nature
• A Mathematical Theory of Communication
• Communication Theory of Secrecy Systems*
• Entropy and algorithmic complexity in quantum information theory
• Entropy as a fixed point
• scientific article; zbMATH DE number 44959 (Why is no real title available?)
• scientific article; zbMATH DE number 1302020 (Why is no real title available?)
• Information-Theoretic Incompleteness
• Is complexity a source of incompleteness?
• On partial randomness
• On the Length of Programs for Computing Finite Binary Sequences
• Randomness and Computability: Open Questions
• Randomness relative to Cantor expansions
• The axiomatization of randomness
• The definition of random sequences
• Theories of computational complexity
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(3)

• What is complexity?
• Approximate NFA universality motivated by information theory
• Approximate NFA universality and related problems motivated by information theory

This page was built for publication: COMPLEXITY, INFORMATION, ENERGY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526535)