COMPLEXITY, INFORMATION, ENERGY
From MaRDI portal
Publication:3526535
DOI10.1142/S0129054108005954zbMath1162.68463OpenAlexW2146051038MaRDI QIDQ3526535
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
Related Items (2)
Approximate NFA universality and related problems motivated by information theory ⋮ Approximate NFA universality motivated by information theory
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Entropy as a fixed point
- A broader view on the limitations of information processing and communication by nature
- Entropy and algorithmic complexity in quantum information theory
- Theories of computational complexity
- Randomness relative to Cantor expansions
- Is complexity a source of incompleteness?
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- On partial randomness
- Randomness and Computability: Open Questions
- Communication Theory of Secrecy Systems*
- The axiomatization of randomness
- Information-Theoretic Incompleteness
- On the Length of Programs for Computing Finite Binary Sequences
- The definition of random sequences
This page was built for publication: COMPLEXITY, INFORMATION, ENERGY
