News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by jvanderbot on Monday July 19, 2021 @06:00PM (#27887755)
This entry from the survey was my favorite:

Prediction by Richard Chang:(Univ of MD Balt County, 2066, P6=NP) In the year, 2066 the idea that computers will double in speed every 18 months (Moore’s Law) has been ludicrous for 50years. As such, no one uses asymptotic analysis anymore. Programs are written in assembly language to shave the running time. Some poor assistant professor will prove that P != NP and fail to get tenure for it

Though I would guess predictive programming and execution would look more like an AI system and would be clawing at throughput gains by "learning" how the programmer of the current program expected things to go ... rather than the programmer working in ASM to make it so.

Re:A proof P = NP was accidentally published in TOCT by jl2718 on Tuesday July 20, 2021 @10:22PM (#27901659)
If it gets to that point, which I think it will, then the there will be no such thing as an instruction set. Computing will be reconfigurable asynchronous data flow.