Results 1 
6 of
6
Evaluating the Complexity of Mathematical Problems. Part 1
, 2009
"... In this paper we provide a computational method for evaluating in a uniform way the complexity of a large class of mathematical problems. The method, which is inspired by NKS1, is based on the possibility to completely describe complex mathematical problems, like the Riemann hypothesis, in terms of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we provide a computational method for evaluating in a uniform way the complexity of a large class of mathematical problems. The method, which is inspired by NKS1, is based on the possibility to completely describe complex mathematical problems, like the Riemann hypothesis, in terms of (very) simple programs. The method is illustrated on a variety of examples coming from different areas of mathematics and its power and limits are studied.
Mathematical Problems. Part 1 ∗
, 2008
"... In this paper we provide a computational method for evaluating in a uniform way the complexity of a large class of mathematical problems. The method is illustrated on a variety of examples coming from different areas of mathematics and its power and limits are studied. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we provide a computational method for evaluating in a uniform way the complexity of a large class of mathematical problems. The method is illustrated on a variety of examples coming from different areas of mathematics and its power and limits are studied. 1