Results 1 -
2 of
2
Ten Problems in Experimental Mathematics
, 2006
"... Challenge ” of Nick Trefethen, beautifully described in [12] (see also [13]). Indeed, these ten numeric challenge problems are also listed in [15, pp. 22–26], where they are followed by the ten symbolic/numeric challenge problems that are discussed in this article. Our intent in [15] was to present ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Challenge ” of Nick Trefethen, beautifully described in [12] (see also [13]). Indeed, these ten numeric challenge problems are also listed in [15, pp. 22–26], where they are followed by the ten symbolic/numeric challenge problems that are discussed in this article. Our intent in [15] was to present ten problems that are characteristic of the sorts of problems
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.
