Related papers: Non computable Mandelbrot-like set for a one-param…
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…
Consider the one-parameter family of cubic polynomials defined by $f_t(z) =-\frac 32 t(-2z^3+3z^2)+1, t \in \mathbb{C}_2$. This family corresponds to a slice of the parameter space of cubic polynomials in $\mathbb{C}_2[z]$. We investigate…
Let $a(\lambda)$ and $b(\lambda)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $\lambda$. We study whether there exist infinitely many…
We completely characterize the conformal radii of Siegel disks in the family $$P_\theta(z)=e^{2\pi i\theta}z+z^2,$$ corresponding to {\bf computable} parameters $\theta$. As a consequence, we constructively produce quadratic polynomials…
Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable…
We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…
A model for the Mandelbrot set is due to Thurston and is stated in the language of geodesic laminations. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We introduce a generalization of the McMullen family $f_{\lambda}(z)=z^n+\lambda/z^d$. In 1988, C. McMullen showed that the Julia set of $f_{\lambda}$ is a Cantor set of circles if and only if $1/n+1/d<1$ and the simple critical values of…
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)…
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…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure $\mathcal A$ as the family of Turing degrees that compute…
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.
In this paper we give two families of non-metrizable topologies on the group of the integers having a countable dual group which is isomorphic to a infinite torsion subgroup of the unit circle in the complex plane. Both families are related…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
In this paper we investigate the derivations of filiform Leibniz algebras. Recall that the set of filiform Leibniz algebras of fixed dimension is decomposed into three non-intersected families. We found sufficient conditions under which…
Le Roux and Ziegler asked whether every simply connected compact nonempty planar co-c.e. closed set always contains a computable point. In this paper, we solve the problem of le Roux and Ziegler by showing that there exists a contractible…