General NP-hardness of computing chaotic sequences

Ascertain whether computing chaotic sequences is NP-hard in general; specifically, determine whether every chaotic sequence is hard to compute in the sense of NP-hard when formalized as natural decision problems about iterates of the underlying dynamical map.

Background

Beyond the tent map, the paper situates its results within the broader context of chaotic dynamics and algorithmic complexity. The authors note that while some NP-complete systems exhibit chaotic behavior, it remains unsettled whether such hardness extends broadly to chaotic sequences when posed as computational decision problems.