Before revision:  \% 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 .
After revision:  \% We first show that there is no stateless algorithm, an algorithm that keeps no state over time , that both approximates the minimum cost of a shape descriptor and achieves bounded speed .