Let $\tau(k)$ be the minimum number of arithmetic operations required to build the integer $k \in \N$ from the constant 1. A sequence $x_k$ is said to be ``easy to compute'' if there exists a polynomial $p$ such that $\tau(x_k) \leq p(\log k)$ for all $k \geq 1$. It is ... more >>>