scientific article; zbMATH DE number 5234254
From MaRDI portal
Publication:5439769
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Higher degree equations; Fermat's equation (11D41) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Recommendations
- The Complexity and Distribution of Hard Problems
- Two measures of difficulty
- Evaluating the complexity of mathematical problems. I
- scientific article; zbMATH DE number 5772857
- A framework for measuring the complexity of mathematical concepts
- The Probability That a Numerical Analysis Problem is Difficult
- scientific article; zbMATH DE number 1500526
Cited in
(19)- Information: The Algorithmic Paradigm
- Fermat's last theorem and chaoticity
- The complexity of Euler's integer partition theorem
- Gödel diffeomorphisms
- Inductive complexity of P versus NP problem (extended abstract)
- The Riemann hypothesis as the parity of special binomial coefficients
- Output concepts for accelerated Turing machines
- Most programs stop quickly or never halt
- A program-size complexity measure for mathematical problems and conjectures
- The complexity of Riemann's hypothesis
- The Riemann hypothesis in computer science
- Evaluating the complexity of mathematical problems. I
- Asymptotic behavior and halting probability of Turing machines
- How much information can there be in a real number?
- Inductive complexity of the P versus NP problem
- On some algebraic ways to calculate zeros of the Riemann zeta function
- Inductive complexity measures for mathematical problems
- Two measures of difficulty
- scientific article; zbMATH DE number 841094 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5439769)
