Non computable Mandelbrot-like set for a one-parameter complex family
Abstract
We show the existence of computable complex numbers λ for which the bifurcation locus of the one parameter complex family fb(z) = λ z + b z2 + z3 is not Turing computable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.