  This paper is motivated by a question whether it is possible to calculate a
chaotic sequence efficiently, e.g., is it possible to get the $n$-th bit of a
bit sequence generated by a chaotic map, such as $\beta$-expansion, tent map
and logistic map in $o(n)$ time/space? This paper gives an affirmative answer
to the question about the space complexity of a tent map. We prove that a tent
code of $n$-bits with an initial condition uniformly at random is exactly
generated in $O(\log^2 n)$ space in expectation.
