Related papers: Non-computable Julia sets
Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.
Let $f$ be a rational map with degree $d\geq 2$ whose Julia set is connected but not equal to the whole Riemann sphere. It is proved that there exists a rational map $g$ such that $g$ contains a buried Julia component on which the dynamics…
For a family of holomorphic functions on an arbitrary domain, we introduce Fatou and Julia like sets, and establish some of their interesting properties.
A. Sannami constructed an example of the differentiable Cantor set embedded in the real line whose difference set has a positive measure. In this paper, we generalize the definition of the difference sets for sets of the two dimensional…
In this article, we introduce the concept of normal families of bicomplex holomorphic functions to obtain a bicomplex Montel theorem. Moreover, we give a general definition of Fatou and Julia sets for bicomplex polynomials and we obtain a…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
We prove that the only possible biaccessible points in the Julia set of a Cremer quadratic polynomial are the Cremer fixed point and its preimages. This gives a partial answer to a question posed by C. McMullen on whether such a Julia set…
A Q-set is an uncountable set of reals all of whose subsets are relative $G_\delta$ sets. We prove that, for an arbitrary uncountable cardinal kappa, there is consistently a Q-set of size $\kappa$ whose square is not Q. This answers a…
There are noncomputable c.e.\ sets, computable from every SJT-hard c.e.\ set. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
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…
Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…
We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
This paper is about the recent notion of computably probably approximately correct learning, which lies between the statistical learning theory where there is no computational requirement on the learner and efficient PAC where the learner…
According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia…
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…
If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are…
The Turing machine (TM) and the Church thesis have formalized the concept of computable number, this allowed to display non-computable numbers. This paper defines the concept of number "approachable" by a TM and shows that some (if not all)…