Constant precision is a distinct assertion

This does not exclude changing the architecture or address length as a function of $\epsilon$. It proves only that an arbitrary-precision theorem requires an additional quantifier and resource bound. Exact finite-program restrictions are also distinct from approximate programming NielsenChuang.