New barriers in complexity theory: On the solvability complexity index and the towers of algorithms
Jonathan Ben‐Artzi, Anders C. Hansen, Olavi Nevanlinna, Markus Seidel · Comptes Rendus Mathématique · 2015
We report on new barriers in the theory of computations. These barriers show that the standard theory of computations and complexity theory is insufficient for many core problems in computational theory. Thus we are in need for a new extended complexity theory. The new theory settles the long-standing computational spectral problem and also provides new fundamental algorithms for quantum mechanics.