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.

Researchers have discovered that problems solvable in time t only require approximately √t bits of memory, challenging long-held beliefs about computational complexity. This breakthrough, presented by MIT's Ryan Williams, demonstrates that efficient memory usage can significantly reduce the space needed for computation. The findings suggest that optimizing memory is more crucial than merely increasing it.