We survey the state of the art on the algorithmic analysis of discrete linear
dynamical systems, focussing in particular on reachability, model-checking, and
invariant-generation questions, both unconditionally as well as relative to
oracles for the Skolem Problem