Richard Bellman

In the 1950s Richard Bellman developed dynamic programming: split a long decision into stages, solve the last stage first and work backwards.

The Bellman equation says the value of where you stand is the best reward now plus the value of where that choice leaves you. It prices American options on binomial trees and is how reinforcement learning teaches AI to act.