Bellman Search in Arbitrary Finite Dimension: A Self-Similar Cell Theorem and Effective Computability of Planar Shoreline Search
A self-similar reduction theorem is established for homogeneous search problems whose historical information is a record profile updated by pointwise maximum and the optimal deterministic planar Shoreline value $C_2^*$ is a computable real.