The Complexity of Mathematics

The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We prove the Goldbach's conjecture is false using the Complexity Theory. An important complexity class is 1NSPACE(S(n)) for some S(n). This proof is based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.