28
votes
11answers
2k views
Important open problems that have already been reduced to a finite but infeasible amount of computation
Most open problems, when formalized, naturally involve quantification over infinite sets, thereby obviating the possibility, even in principle, of "just putting it on a computer."
…
3
votes
1answer
335 views
Efficiently computing with pullbacks and pushouts
Often when computing in category theory, one has to show that some square is cartesian. Depending on the number of maps involved, and their arrangement, it's somewhat difficult to …

