@sophieschmieg i kinda wish the P=NP problem gets solved in a similar way (ideally not by “AI”): either someone finds an algorithm running in O(n^{a lot}) with a prohibitive additive constant for solving NP problems (officially fast, realistically slow), or conversely someone manages to solve NP problems in time O((1 + {something small})^n) (realistically fast, officially slow). both would render the question somewhat moot 🙃