scientific article; zbMATH DE number 5234254
From MaRDI portal
Publication:5439769
zbMath1139.03028MaRDI QIDQ5439769
Elena Calude, Michael J. Dinneen, Cristian S. Calude
Publication date: 11 February 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Higher degree equations; Fermat's equation (11D41) Turing machines and related notions (03D10)
Related Items (12)
A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ How Much Information Can There Be in a Real Number? ⋮ Fermat's last theorem and chaoticity ⋮ Output concepts for accelerated Turing machines ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ The Riemann hypothesis as the parity of special binomial coefficients ⋮ Asymptotic behavior and halting probability of Turing machines ⋮ Inductive Complexity of P versus NP Problem ⋮ Most programs stop quickly or never halt ⋮ The complexity of Euler's integer partition theorem ⋮ The Riemann hypothesis in computer science ⋮ Information: The Algorithmic Paradigm
This page was built for publication:
