1. In a processor for solving dynamic programming problems, the combination comprising: A. first computation means to compare data representative of candidate transitions to or from each one of a first plurality of states of a stage of a dynamic programming problem, to determine the optimum one of said first plurality of state transitions; B. second computation means to compare data representative of candidate transitions to or from each one of a second plurality of states of said stage of dynamic programming problem, to determine the optimum one of said second plurality of state transitions; and C. third computation means to compare data representative of the optimum ones of said state transitions of said first and second pluralities, simultaneously with comparison by said first and second computation means of data respectively representative of transitions to or from states of third and fourth pluralities of states of a successive stage of said dynamic programming problem to determine the optimum one of said state transitions of said third and fourth pluralities.