Invariance and Universality of Complexity

DOI10.1007/978-3-642-27654-5_11zbMath1353.68145OpenAlexW1529663204MaRDI QIDQ2891308

Helmut Jürgensen

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_11

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items

The complexities of nonperturbative computations ⋮ DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite state complexity
• Theories of computational complexity
• Is independence an exception?
• Is complexity a source of incompleteness?
• Der programmierbare endliche Automat. (The programmable finite automaton)
• Algorithmic Information Theory