Extremely strange reasoning from Aaronson. He goes from the question "How hard is it to solve P?=NP" to a vague existence claim of a program that cannot be concretely written, unless it takes "P==NP" and "P!=NP" as inputs, which would be a tautology.
This claimed program does not answer the above question at all. His students are correct, he is wrong.
This claimed program does not answer the above question at all. His students are correct, he is wrong.