Noun
angelic non-determinism (uncountable) (computing theory) A notional ability always to choose the most favorable option, in constant time. With angelic non-determinism, any problem in NP would be solvable in polynomial time.