Aaronson's proof involves an observation that PostBQP = PP, in other words, all of the problems you can solve with an especially powerful quantum computer can also be solved with an even more especially powerful classical computer, and vice versa. Since the quantum computer is easier to reason about, you get a hard result as a freebie.
BQP is not a tongue-in-cheek thing; it's also not a well-understood thing -- just "anything which quantum computers can do in this way quickly with bounded errors" -- but it's certainly better understood than this amplituhedron is. The real problem he's highlighting is that complexity classes like BQP have scary names.
For the sake of this discussion, you can imagine a similar problem with "programmable imperative syntax" and "monads". Really all that monads are, in a computing context, is a way of formalizing a programmable imperative syntax as a purely functional programming construct. The issue is that when you say "functional" and "monads" then people kind of just shut down, they don't want to hear about it. Does that make sense?
Sort of like the number omega, which contains in each digits proofs to every theorem, but is not computable:
It doesn't meet the definition of a framework: http://en.wikipedia.org/wiki/Software_framework
> It trivially encompasses every possible Javascript program
Not every one.
But then he threw me when he linked to what appears to be a real proof. I read through it, and found no signs it was tongue-in-cheek itself.
So I'll admit I'm at an impasse here; if he's got a real mathematical construct that is usefully better than what was presented, I don't get the tongue-in-cheek tone; if it really is tongue-in-cheek, I don't get what the real proofs are doing there, unless the proof is itself the best-disguised joke I've seen in the math world. (Generally I've got a pretty good eye for mathematician humor, even in fields I know little about.)