The Complexity of MathematicsEasyChair Preprint no. 3062, version historyVersion  Date  Pages  Version notes 

1  March 29, 2020  13  —  2  April 20, 2020  6  I have submitted a new version of Preprint 3062 (The Complexity of Mathematics) as an extension of the older version. Certainly, in this version we found another way to prove the problem PRIMES is not in 1NSPACE(S(n)) for all S(n). The previous version was flawed in this proof. In this way, the proof of Riemann hypothesis and Goldbach's conjecture are still valid according to the older version, because they are supported in that previous proof in the same way. Indeed, we found the other problems exposed in the older version have not a strong proof. For that reason, they were removed from this new version.  3  June 4, 2020  7  I added some missing arguments that the proofs needed in order to be correct.  4  June 7, 2020  7  I have assumed in the previous version that the Goldbach's conjecture were true, because this won't have an infinite number of counterexamples. However, this assumption have not been precisely proved yet. For that reason, we removed and changed the abstract and content of the paper.  5  June 8, 2020  7  I have improved the Theorems 4 and 7 just remarking there are only two options, that is, our target language could be regular or nonregular and its complement is infinite or is equal to the empty set.  6  June 10, 2020  6  We changed 1NSPACE by NSPACE and used the complement instead of the original language. For that purpose, we have changed the abstracts, the keywords and the content of the paper.  7  June 10, 2020  6  We state there are only three options: coL is equal to the empty set or coL in REG or coL is nonregular and coL is infinite, but the true statement should be: coL is equal to the empty set or coL in REG and coL is not empty or coL is nonregular and coL is infinite.  8  June 11, 2020  6  We restate the Goldbach's conjecture to true again.  9  June 11, 2020  7  I realize the infinite number of counterexamples in the Goldbach conjecture is possible when this set is sparse. In this way, we come back to the argument of previous version. We added a Conclusions section in this version.  10  June 11, 2020  7  I have stated the Robin's inequality is always true on p for every prime number p, but I didn't specify that must be for every prime number p greater than 10. This is fixed in this version. 
Keyphrases: complexity classes, Conjecture, number theory, primes, reduction, regular languages 
