scientific article; zbMATH DE number 5679757
From MaRDI portal
Publication:5188206
zbMath1186.68226MaRDI QIDQ5188206
Elena Calude, Cristian S. Calude
Publication date: 10 March 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ Fermat's last theorem and chaoticity ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ Approximating Kolmogorov complexity ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ The axiomatic power of Kolmogorov complexity ⋮ Inductive Complexity of P versus NP Problem ⋮ The complexity of Euler's integer partition theorem ⋮ The Riemann hypothesis in computer science
This page was built for publication:
