# Computational Complexity of the Logistic Map

Computational Complexity of the Logistic Map

This Demonstration shows the computational space complexity needed to exactly compute the iteration of the logistic equation =μ(1-). The initial value of the iteration is , with , the number of iterations performed, and , the bifurcation parameter for the logistic map. Each value of the orbit, , is computed up to relative error of .

x

n+1

x

n

x

n

x

0

N

μ

x

n

n=0,…,N

-p

10