P=NP is undecidable (conjecture) Posted by Mihvoi April 03, 2017 Complexity Compression Computer Science Conjecture Information Theory Kolmogorov Mathematics P versus NP Philosophy Turing Undecidable +
