But as a lone bit, I suspect it’s still pretty useless. It’s not like you can publish it.
Without a proof or some indication of the reasoning, it’s not going to advance the field much. (‘not by one bit.’ ha!)
Sometimes brute forcing is just iterating over the answer space and running some process. We can pretend we got a result indicating P=NP and do math from there, if that were useful. Then try the other way around.
A P?=NP solver would need more than one ouput bit, in case it needed to kick out an error, and isn’t that just asking to be run again? Could you not? With that question, any non-answer is a mindhack.
True, as bits go, that would be a doozy.
But as a lone bit, I suspect it’s still pretty useless. It’s not like you can publish it.
Without a proof or some indication of the reasoning, it’s not going to advance the field much. (‘not by one bit.’ ha!)
Sometimes brute forcing is just iterating over the answer space and running some process. We can pretend we got a result indicating P=NP and do math from there, if that were useful. Then try the other way around.
A P?=NP solver would need more than one ouput bit, in case it needed to kick out an error, and isn’t that just asking to be run again? Could you not? With that question, any non-answer is a mindhack.