News for hackers. Stuff that matters.
Re:Computational Complexity Theory by Cieplak on Sunday August 14, 2016 @01:21AM (#12284367)
Gö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.

There are no comments on this comment yet.