Evaluating the Complexity of Mathematical Problems: Part 1
Cristian S. Calude, Elena Calude · Complex Systems · 2009
In this paper we present an implementation of the computational method in [5] allowing to rank in complexity mathematical statements. We introduce the complexity classes (CU,i)i≥1, and, accordingly, we show that the Legendre’s conjecture, Fermat’s last theorem and Goldbach’s conjecture are in CU,1, Dyson’s conjecture is in CU,2, the Riemann hypothesis is in CU,3, and the four colour theorem is in CU,4.