A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Errata: Dynamic Programming, Successive Approximations, and Monotone Convergence

1958
*
Proceedings of the National Academy of Sciences of the United States of America
*

the triple (P( 1A), AF, A) where A = U jA3 = U j [w; x(a(w), w) = j] will follow using our proof if one chooses the approximating an(w) more delicately. Let R5 = [2-'; m = 1, 2 ... ] for p = 1, 2 ... and let R = U ,Rp be a separability set for x(t, w). Since x(t, w) e 9t* the set [uw; w e A1, ac(w) <t] e T, Ix(s), s < t . Let xr,[O = a" , < a2, , < ... ] be a sequence of partitions of [0, co) with norms tending to 0 and define the optional random variables as ap*(w) = ak on Bk = [W; ak-i < a <

doi:10.1073/pnas.44.9.978
fatcat:ii4baixyofatjkihffbrouvkne