Invariance and Universality of Complexity

DOI10.1007/978-3-642-27654-5_11MaRDI QIDQ2891308zbMATH OpenOpenAlexFDO

Authors 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 randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Universal symmetry of complexity
• Complex universality
• scientific article; zbMATH DE number 3896307
• Complexity invariance of real interpretations
• scientific article; zbMATH DE number 1909828
• Universality, optimality, and randomness deficiency
• scientific article; zbMATH DE number 1532228
• Complexity in dynamics and computation
• Machines, Computations, and Universality

Cites work

• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• Algorithmic Information Theory
• Der programmierbare endliche Automat. (The programmable finite automaton)
• Finite state complexity
• Is complexity a source of incompleteness?
• Is independence an exception?
• Theories of computational complexity

Cited in

(6)

• Finite state complexity
• Algorithmic information theory and computational complexity
• Increasing the gap between descriptional complexity and algorithmic probability
• Descriptional complexity in encoded Blum static complexity spaces
• State-size hierarchy for finite-state complexity
• The complexities of nonperturbative computations

This page was built for publication: Invariance and Universality of Complexity

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