Evaluating the Complexity of Mathematical Problems. Part 1

Evaluating the Complexity of Mathematical Problems. Part 1 (2009)

by C. S. Calude , Elena Calude

Citations:

1 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	Evaluating the Complexity of Mathematical Problems. Part 1	user correction
AUTHOR NAME	C. S. Calude	user correction
AUTHOR AFFIL	University of Auckland, NZ	user correction
AUTHOR ADDR		user correction
AUTHOR NAME	Elena Calude	user correction
AUTHOR AFFIL	Massey University at	user correction
AUTHOR ADDR	Albany, NZ	user correction
ABSTRACT	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.	user correction
YEAR	2009	SVM HeaderParse 0.2
CITATIONS	29 found	ParsCit 1.0