Related papers: Non-computable Julia sets
Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…
We consider the issue of computability at the most fundamental level of physical reality: the Planck scale. To this aim, we consider the theoretical model of a quantum computer on a non commutative space background, which is a computational…
We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…
A generalization of the filled-in Julia set is presented using the multicomplex numbers and an algorithm is presented to visualize these sets in the tridimensional space. There are many ways to visualize these higher dimensional fractals…
We prove a Julia inequality for bounded non-commutative functions on polynomial polyhedra. We use this to deduce a Julia inequality for holomorphic functions on classical domains in $\mathbb{C}^d$. We look at differentiability at a boundary…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
We continue the study of constructing invariant Laplacians on Julia sets, and studying properties of their spectra. In this paper we focus on two types of examples: 1) Julia sets of cubic polynomials $z^3 + c$ with a single critical point;…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…
In this paper, we give a family of rational maps whose Julia sets are Cantor circles and show that every rational map whose Julia set is a Cantor set of circles must be topologically conjugate to one map in this family on their…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
For a sequence $(\lambda_n)$ of positive real numbers we consider the exponential functions $f_{\lambda_n} (z) = \lambda_n e^z$ and the compositions $F_n = f_{\lambda_n} \circ f_{\lambda_{n-1}} \circ ... \circ f_{\lambda_1}$. For such a…
It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles.
There exist uniformly quasiregular maps $f:\mathbb{R}^3 \to \mathbb{R}^3$ whose Julia sets are wild Cantor sets.
We prove a non-abelian arboreal Galois group result for certain maps with non-real Julia set at an archimedean place. We investigate the question of determining which polynomials defined over $\mathbb{R}$ have real Julia set. Finally we…
For a sequence of complex parameters $\{c_n\}$ we consider the compositions of functions $f_{c_n} (z) = z^2 + c_n$, which is the non-autonomous version of the classical quadratic dynamical system. The definitions of Julia and Fatou sets are…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…