3 ms·
In all likelihood, if P = NP (which most people don't think is true) it won't be in a way that allows for practical algorithms. You won't be able to get more mo
by daveFNbuck 10y ago
In all likelihood, if P = NP (which most people don't think is true) it won't be in a way that allows for practical algorithms. You won't be able to get more money by hiding such a proof than by sharing it.
- Cieplak 10y agoGödel's theorem implies that Turing machines are not complete. The problems of floating point numbers exemplify this. Our existing machine architectures operate on a discrete silicon substrate (ℤ), but we live in a continuously differentiable spacetime continuum (ℝ). I don't think this has any deep implications for P = NP, though; it's just a tooling issue.