Is anything known about ExpSpace problems whose configuration reachability problems are in P/poly?Let $M$ be an ExpSpace machine.   Given two configurations $a$ and $b$ of $M$ (of max length), and an integer $t$,  can $M$ reach $b$ from $a$ in $t$ steps?Note that the length of $a$, $b$ and $t$ are exponentially large in terms of the length of the input to $M$. So the P/poly machine runs exponential time with an exponentially-long advice string. But it should not be something like $\mathsf{EXPSPACE} \cap \mathsf{EXP/exp}$ (and thus simply EXPSPACE) for obvious reasons.
ExpSpace problems whose configuration reachability problems are in P/poly?
cc.complexity theory;complexity classes;advice and nonuniformity