Evaluating the Complexity of Mathematical Problems: Part 2
Cristian S. Calude, Elena Calude · Complex Systems · 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 NKS 1 , 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.