4 ms·
I wonder how many people are arbitraging proofs of P = NP. If it were a solved problem, which I suspect it is, surely folks wouldn't talk about their solutions
by Cieplak 10y ago
I wonder how many people are arbitraging proofs of P = NP. If it were a solved problem, which I suspect it is, surely folks wouldn't talk about their solutions when they could rather print money :)
- daveFNbuck 10y agoIn 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.