I was just linking to Langlands as another example of duality of topics in mathematics. Just like NP-complete problems are equivalent, the hardest problems in m

I was just linking to Langlands as another example of duality of topics in mathematics. Just like NP-complete problems are equivalent, the hardest problems in mathematics are most likely also part of some complexity class and equivalent to eachother. Take what we see here and in Langlands and generalize it to information, computation, formal languages, model theory, in general. There is probably a unified theory of "problems" that glues all the hardness together. Just my opinion..not a claim.