I read several times of Scott Aaronson saying that P=NP implies that human creativity is boring and something like that, and that P=NP has something to do with proof automation. I don't get his argument, despite having studied basic complexity theory. What is he talking about?
How can P=NP relate to creativity and proof automation, as said by Scott Aaronson?
complexity theory;complexity classes