Certainly, I’m not an expert and the experts believe generally believe P != NP. That’s why they spend their time trying to prove it. They also spend time trying

Certainly, I’m not an expert and the experts believe generally believe P != NP. That’s why they spend their time trying to prove it. They also spend time trying to prove that we will never know. There’s comparatively not much effort given to prove the opposite. See the opposite doesn’t mean all problems are easy. They could still be hard, e.g. N^M with a really large M. In addition, we often prove things by contradiction. Wouldn’t it be interesting if the proof by contradiction involved finding a solution to another hard problem that today we cannot easily find. Deep learning models trained and scaled on instances of the subproblem may be able to help us do that. Anyway, it’s just a thought. Think of it as complexity-poetry.