I came across this paper by Scott Aaronson and though I understand nothing of quantum computing, the fact that there was an (even hypothetical and probably unrealizable) model of
ALL which he claims, theoretical or otherwise, that solves
ALL is apparently defined as the class (aptly) of all decision problems, this seems to completely transcend all Turing degrees and the arithmetical hierarchy, which blows my mind because this is the first I've heard of any approach, hypercomputation or otherwise, that does that.
So my question is two-fold:
- Does solving
ALLreally do what I what I just laid out above, in particular does it transcend all oracles?
- Does the approach laid out in the paper do that?