相关论文: Non-computable Julia sets
It is known that the disconnected Julia set of any polynomial map does not contain buried Julia components. But such Julia components may arise for rational maps. The first example is due to Curtis T. McMullen who provided a family of…
Dynamic languages have become popular for scientific computing. They are generally considered highly productive, but lacking in performance. This paper presents Julia, a new dynamic language for technical computing, designed for performance…
Fractals offer the ability to generate fascinating geometric shapes with all sorts of unique characteristics (for instance, fractal geometry provides a basis for modelling infinite detail found in nature). While fractals are non-euclidean…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
In his seminal paper from 1936, Alan Turing introduced the concept of non-computable real numbers and presented examples based on the algorithmically unsolvable Halting problem. We describe a different, analytically natural mechanism for…
We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper surveys some results that are known concerning the…
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…
In this article, we introduce the adapted inverse iteration method to generate bicomplex Julia sets associated to the polynomial map $w^2+c$. The result is based on a full characterization of bicomplex Julia sets as the boundary of a…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.
Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools for quantum information theory implemented in various programming languages. However, there is…
Let f be a rational function such that the multipliers of all repelling periodic points are real. We prove that the Julia set of such a function belongs to a circle. Combining this with a result of Fatou we conclude that whenever J(f)…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
In this paper we introduce the notion of dynamical systems over the class of the normed real nonassociative algebras not necessarily finite-dimensional, generalize the classical filled Julia and Mandelbrot sets over the complex numbers,…
We give an alternative way to construct an entire function with quasiconformal surgery so that all its Fatou components are quasi-circles but the Julia set is non-locally connected.
A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…
Makienko's conjecture, a proposed addition to Sullivan's dictionary, can be stated as follows: The Julia set of a rational function R has buried points if and only if no component of the Fatou set is completely invariant under the second…
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.