# On computational complexity of Cremer Julia sets

## TL;DR

This paper demonstrates that Cremer Julia sets can have arbitrarily high computational complexity, highlighting the intricate nature of their structure.

## Contribution

It establishes the existence of Cremer Julia sets with arbitrarily high computational complexity, advancing understanding of their computational properties.

## Key findings

- Cremer Julia sets can be arbitrarily complex computationally.
- The paper provides constructions of high-complexity Julia sets.
- It deepens the link between dynamical systems and computational complexity.

## Abstract

We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.