Non computable Mandelbrot-like set for a one-parameter complex family
classification
🧮 math.DS
keywords
complexcomputablefamilylambdabifurcationexistencelocusmandelbrot-like
read the original abstract
We show the existence of computable complex numbers $\lambda$ for which the bifurcation locus of the one parameter complex family $f_{b}(z) = \lambda z + b z^{2} + z^{3}$ is not Turing computable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.