>> Software engineers and computer scientists already have a tool for understanding the limits of infinite spaces - the P vs NP problem - as well as an accepted

>> Software engineers and computer scientists already have a tool for understanding the limits of infinite spaces - the P vs NP problem - as well as an accepted wisdom that there is a known area of algorithm research that is too unrealistic to be productive, because working on it would be functionally equivalent to proving P = NP. Not to be contrary, but P ≠ NP is only conjectured and some computer scientists do indeed expect that a proof of P = NP will eventually be demonstrated. Not me, actually, but for example a computer science author called Donald Knuth [1] thinks that P = NP and that a proof will eventually become known but even so it's not going to be terribly useful to anyone: https://www.youtube.com/watch?v=XDTOs8MgQfg https://www.youtube.com/watch?v=XDTOs8MgQfg ______ [1] Yes I know. But just in case.