Before revision:  Within this framework, we show that decidability imposes absolute limits to the growth of complexity on computable dynamical systems up to a logarithm of a logarithmic term.
After revision:  Within this framework, we show that decidability imposes absolute limits to the growth of complexity on computable dynamical systems up to a double logarithmic term.