That clearly implies solving. Aaronson is pretty sloppy with his own definitions and yet criticizes his students.
An unambiguous presentation would be:
1) Contrary to usual language use, we define "answer P?=NP" as "print 'yes' or 'no' or 'undecidable'".
2) By "program" we do not mean a single program, but three separate programs that print "yes", "no", or "undecidable".
3) We claim the existence of the program, not that it will ever be possible to know which of the three programs is correct.
You can think of it not as he is describing three separate programs, but giving three separate possible descriptions of one program and asserting that one of them is indeed the correct description.
Consider this rephrasing of the question: “Let X be an NP-complete problem. Can X be solved in polynomial time?” This is a problem with an infinite number of instances, all of which reduce to “P?=NP”, so we know that this problem can be decided in constant time.
Anyway, even if it were an invalid question, his answer still does not make any sense.
The answer is trying to show the absurdity of the question. It's like asking for the time complexity of factoring 120. If there is no input to the algorithm, the answer is always trivial.