Research
The Collatz 3n+1 Conjecture is Unprovable
Article
July 27, 2012
In this paper, we show that any proof of the Collatz 3n + 1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.
The Computational Complexity of the Traveling Salesman Problem
Article
January 1, 1970
In this note, we show that the Traveling Salesman Problem cannot be solved in polynomial-time on a classical computer.
