Unsolved problem in computer science: Is there a polynomial time isomorphism between every two NP-complete languages? Wikipedia