Theoretical Computer ScienceThe Complexity of Goldbach’s Conjecture and Riemann’s Hypothesis (2009)
by
Elena Calude
,
Elena Calude
BibTeX
@MISC{Calude09theoreticalcomputer,
author = {Elena Calude and Elena Calude},
title = {Theoretical Computer ScienceThe Complexity of Goldbach’s Conjecture and Riemann’s Hypothesis},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we obtain better upper bounds on the complexities of Goldbach’s Conjecture and Riemann’s Hypothesis in [3] and [8] by improving the register machine language used as well as the optimisation technique. 1
Citations
| 264 | Algorithmic Information Theory - Chaitin - 1987 |
| 125 | On Hilbert’s tenth problem - Matiyasevich - 2000 |
| 49 | Information and Randomness: An Algorithmic Perspective, 2nd edn. Revised and Extended - Calude - 2002 |
| 9 | M.J.: A new measure of the difficulty of problems - Calude, Calude, et al. - 2006 |
| 3 | Calude. Evaluating the Complexity of Mathematical Problems - Calude, Elena |
| 2 | E.: The Complexity of the Four Colour Theorem - Calude, Calude - 2010 |
| 2 | On the Difficulty of Goldbach and - Hertel - 2009 |
