While some of my work is in analytic number theory, much is in other subareas, so it is possible I should defer to you on this. It seems to me less than PNT in terms of what can we actually do with this. Many different…
Generalized Riemann hypothesis.
Yeah, completely reasonable to argue that.
Number theorist here. This is a massive big deal, and would likely be a Fields Medal for a human if a human had done it. But it is an exaggeration to say it is the biggest result in 200 years. At a minimum, it is hard…
I really like the product you've made, and use it regularly. It might be helpful for your user base, and the project as a whole if one responded with a little more than a shrug. Facebook may be more willing to listen to…
To expand on what phil is saying: It is by itself logically consistent for someone to decide that there's enough fun left in their life and enough stuff that they need to do that they don't want to die now even if they…
Uncomputable problems are not necessarily NP-hard. You can for example encode a version of the halting problem such that the instances are simply very long. For example, consider the language L defined by k is in L iff…
While some of my work is in analytic number theory, much is in other subareas, so it is possible I should defer to you on this. It seems to me less than PNT in terms of what can we actually do with this. Many different…
Generalized Riemann hypothesis.
Yeah, completely reasonable to argue that.
Number theorist here. This is a massive big deal, and would likely be a Fields Medal for a human if a human had done it. But it is an exaggeration to say it is the biggest result in 200 years. At a minimum, it is hard…
I really like the product you've made, and use it regularly. It might be helpful for your user base, and the project as a whole if one responded with a little more than a shrug. Facebook may be more willing to listen to…
To expand on what phil is saying: It is by itself logically consistent for someone to decide that there's enough fun left in their life and enough stuff that they need to do that they don't want to die now even if they…
Uncomputable problems are not necessarily NP-hard. You can for example encode a version of the halting problem such that the instances are simply very long. For example, consider the language L defined by k is in L iff…