# Computational intractability of attractors in the real quadratic family

## TL;DR

This paper demonstrates that certain real quadratic maps have attractors that are computationally intractable, marking the first known natural examples of such complexity in dynamical systems.

## Contribution

It introduces the first known natural examples of real quadratic maps with attractors that are computationally intractable.

## Key findings

- Existence of real quadratic maps with intractable attractors
- First natural examples of such intractability in dynamical systems
- Implications for computational complexity in mathematical models

## Abstract

We show that there exist real quadratic maps of the interval whose attractors are computationally intractable. This is the first known class of such natural examples.