Researchers are using reverse mathematics to explore why certain computational problems, like the traveling salesperson problem, are hard to prove. By swapping theorems and axioms, they’ve shown surprising equivalences between foundational concepts in complexity theory, such as the pigeonhole principle and lower bounds for palindromes. This work aims to clarify the limits of existing axioms and advance understanding in metamathematics.