The Complexity of Riemann's Hypothesis

被引：0
|
作者：
Calude, Elena [1 ]
机构：
[1] Massey Univ, Inst Informat & Math Sci, Auckland, New Zealand
来源：
JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING | 2012年 / 18卷 / 3-4期
关键词：
Riemann's Hypothesis; Pi(1) statement; register machine;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we obtain a significantly better upper bound on the complexity of the Riemann's Hypothesis in [3] by improving the universal register machine language used as well as the optimisation technique. In particular, we prove that the Riemann Hypothesis is in the complexity class C-U,C-3 while the Four Colour Theorem is in C-U,C-4.
引用
收藏
页码：257 / 265
页数：9
相关论文
共 50 条
12345