This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory satisfying a reasonable axiom called “indifference to the identity,” we could solve the Graph Isomorphism and Approximate… (More)