With angelic non-determinism, any problem in NP would be solvable in polynomial time.
Moving from a single-processor to a multi-processor system often exposes hidden non-determinism due to invalid assumptions about scheduling.
Projection of an automaton almost always results in non-determinism.