For 10 points, name these methods of solving a problem in a finite number of steps, some of which are "sort" and "search" ones.
An open question about these is whether those that exploit randomness such as those related to languages in BPP are more powerful than deterministic ones. Models on which the behavior of these evaluated include the cell probe, decision tree, and PRAM. If they exploit optimal substructure and memoization they can be considered "dynamic" and if they recursively breakup a problem they are "divide and conquer". Examples include the Bellman-Ford, Euclid's, and Dijkstra (DIKE stra)'s. For 10 points, name these methods of solving a problem in a finite number of steps, some of which are "sort" and "search" ones.
An open question about these is whether those that exploit randomness such as those related to languages in BPP are more powerful than deterministic ones.
{algorithm} [or {computation}; accept {Turing machine} before {cell probe}]