41 research outputs found
The Space Complexity of Generating Tent Codes
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 -th bit of a
bit sequence generated by a chaotic map, such as -expansion, tent map
and logistic map in 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 -bits with an initial condition uniformly at random is exactly
generated in space in expectation