We discuss the spatial mixing properties of infinite horizon dynamic programming on trees and relate it to the convergence properties of message-passing algorithms.