Post #2712422

@RonJeffries@mastodon.social Depending on your notion of specification... P=NP depends on whether polynomial time complexity classes have an essential distinction between verification and implementation. Specification could be viewed as 3rd distinct phase of process, or unified with either tests (~in NP) or with implementation (~in P). If P=NP, all these can be easily unified. If P != NP, the tests/specifications have different complexity than the implementation, and they have different role due to complexity.