Related papers: Hypercomputing the Mandelbrot Set?
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.
Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation…
The Mandelbrot set is a fractal which classifies the behaviour of complex quadratic polynomials. Although its remarkably simple definition: $\mathcal{M}:=\{c \in \mathbb{C}\,|\,Q_c(0)^n \nrightarrow \infty \mbox{ as } n\rightarrow \infty,…
We investigate with the help of Clifford algebraic methods the Mandelbrot set over arbitrary two-component number systems. The complex numbers are regarded as operator spinors in D\times spin(2) resp. spin(2). The thereby induced (pseudo)…
Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…
The famous MLC Conjecture states that the Mandelbrot set is locally connected, and it is considered by many to be the central conjecture in one-dimensional complex dynamics. Among others, it implies density of hyperbolicity in the quadratic…
We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems of scientific computation. In the introduction we also…
Julia and Mandelbrot sets, which characterize bounded orbits in dynamical systems over the complex numbers, are classic examples of fractal sets. We investigate the analogs of these sets for dynamical systems over the hyperbolic numbers.…
In this article, we study some potential theoretical and topological aspects of the generalized Mandelbrot set introduced by Baker and DeMarco. For $\alpha$ real, we study the set of all totally real algebraic parameters $c$ such that…
Hyperbolic numbers are a variation of complex numbers, but their dynamics is quite different. The hyperbolic Mandelbrot set for quadratic functions over hyperbolic numbers is simply a filled square, and the filled Julia set for hyperbolic…
In this paper it is shown analytically and computationally that the Mandelbrot set of integer order are particular cases of Julia sets of Caputo s like fractional order. Also the differences between the fractional-order Mandelbrot set and…
We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…
In this note we give answers to questions posed to us by J.Milnor and M.Shub, which shed further light on the structure of non-computable Julia sets.
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is…
One of the fundamental properties of the Mandelbrot set is that the set of postcritically finite parameters is structured like a tree. We extend this result to the set of quadratic kneading sequences and show that this space contains no…
In this paper the fractional-order Mandelbrot and Julia sets in the sense of $q$-th Caputo-like discrete fractional differences, for $q\in(0,1)$, are introduced and several properties are analytically and numerically studied. Some…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…