COMPLEXITY, INFORMATION, ENERGY

DOI10.1142/S0129054108005954zbMATH Open1162.68463OpenAlexW2146051038MaRDI QIDQ3526535FDOQ3526535

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

Cited In (3)

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

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)