 \% We first show that there is no stateless algorithm, which depends only on the input points in one timestep and not on previous states , that both approximates the minimum cost of a shape descriptor and achieves bounded speed .
<coherence>  \% We first show that there is no stateless algorithm, which depends only on the input points in one timestep and not on previous states , that both approximates the minimum cost of a shape descriptor and achieves bounded speed .
 We first show that there is no stateless algorithm, which depends only on the input points in one timestep and not on previous states , that both approximates the minimum cost of a shape descriptor and achieves bounded speed .