I must say, you have a very pessimistic/optimistic view of AI would be able to solve P=NP. I won’t say you’re completely wrong, as there’s always a chance that P does equal NP. But I would be very careful of predicting anything based on the possibility of P=NP.
I think P?=NP is a distraction. Like, it’s not very useful to ask the question of whether Lee Sedol played a ‘polynomial’ number of games of Go, and AlphaGo played a ‘nonpolynomial’ number of games of Go. AlphaGo played more games and had a more careful and precise memory, and developed better intuitions, and could scale to more hardware better.
I must say, you have a very pessimistic/optimistic view of AI would be able to solve P=NP. I won’t say you’re completely wrong, as there’s always a chance that P does equal NP. But I would be very careful of predicting anything based on the possibility of P=NP.
I think P?=NP is a distraction. Like, it’s not very useful to ask the question of whether Lee Sedol played a ‘polynomial’ number of games of Go, and AlphaGo played a ‘nonpolynomial’ number of games of Go. AlphaGo played more games and had a more careful and precise memory, and developed better intuitions, and could scale to more hardware better.