In case anyone wonders, I think the same argument is made in a somewhat easier to understand way in one section of the the P vs NP wikipedia page [2]. But I th

In case anyone wonders, I think the same argument is made in a somewhat easier to understand way in one section of the the P vs NP wikipedia page [2]. But I think that would turn (b) into a special case of (a) i.e. a bizarre algorithm that is completely useless. And it would also be an algorithm of mostly unknown complexity (with P=NP, we'd know it to be ∈ P, but we won't necessarily know anything else). [2] https://en.wikipedia.org/wiki/P_versus_NP_problem#Polynomial-time_algorithms https://en.wikipedia.org/wiki/P_versus_NP_problem#Polynomial...