Or, that the mathematical formalisms that model the limits of software performance are firm enough that barring P==NP, nothing much will change despite proofs of beautiful math.
replyThis also makes the assumption that frontier math has all the long hanging fruits already taken... also very dubious.
replySome of the problems solved here, at least in CS, have been open for decades, and have been worked on by very smart leading researchers in the field, including Turing Award winners.
replyLike, these would be best-paper awards at many top CS conferences.
Unlike math, software is constrained by the physical world.
replyIn what sense?
replyFor example, pi can be computed to arbitrarily many digits, but could only even in principle be accurately represented with physical objects to a precision that many humans could memorize easily. This is thanks to physical constraints such as "diameter of the observable universe" and "Planck length", at a minimum.
reply