News for hackers. Stuff that matters.
[dead]
Re:P = NP Proofs: Advice to claimers by Chirono on Monday April 22, 2019 @01:33PM (#19720828)
I suspect you're just trolling, but for anyone else: This is true for any bounded input, yes, but doesn't hold for an infinite domain.
Re:P = NP Proofs: Advice to claimers by ryanstrug on Monday April 22, 2019 @01:14PM (#19720660)
‪More specifically algorithms solve arbitrary sets of inputs and outputs. Different algorithms can be aligned with different sets of inputs and outputs that are less natural but within the P=NP criteria.‬