For a certain definition of sufficiently good prior work, universities will grant PhDs. When I was in high school, I took a summer program at CMU and the professor Steven Rudich said that if we were to prove P=NP or P!=NP or prove it undecidable or whatever, that would be good for an instant PhD from CMU. I’m pretty sure the problem he referred to was P/NP, but it’s been a while and it may have been another Millennium Problem.
So if you happen to have a proof for P/NP sitting around, let me know and I’ll introduce you to Dr. Rudich.
For a certain definition of sufficiently good prior work, universities will grant PhDs. When I was in high school, I took a summer program at CMU and the professor Steven Rudich said that if we were to prove P=NP or P!=NP or prove it undecidable or whatever, that would be good for an instant PhD from CMU. I’m pretty sure the problem he referred to was P/NP, but it’s been a while and it may have been another Millennium Problem.
So if you happen to have a proof for P/NP sitting around, let me know and I’ll introduce you to Dr. Rudich.