Related papers: Non computable Mandelbrot-like set for a one-param…
In this article, the dynamics of a one-parameter family of functions $f_{\lambda}(z) = \frac{\sin{z}}{z^2 + \lambda},$ $\lambda>0$, are studied. It shows the existence of parameters $0< \lambda_{1}< \lambda_{2}$ such that bifurcations occur…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
In this article, we provide the first theoretical framework guaranteeing that computers can, in principle, be used to analyze the parameter space of complex H\'{e}maps. More precisely, we obtain computability results for hyperbolic…
The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…
There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…
A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the…
We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a…
Let $X$ be a complex torus of dimension $g$ and $\hat{X}$ be the dual torus. For any $g(g-1)/2$-tuple $\lambda$ of complex numbers of absolute value $1$, we define a non-commutative complex torus $X_\lambda$ as a sheaf of algebras on a real…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the…
We study the notion of tangent-like maps, which is a transcendental analogue of polynomial-like maps. We introduce a model family analogous to quadratic polynomials, with only one free asymptotic value, and define the "Tandelbrot set" as…
We give algebraic and geometric classifications of $4$-dimensional complex nilpotent terminal algebras. Specifically, we find that, up to isomorphism, there are $41$ one-parameter families of $4$-dimensional nilpotent terminal (non-Leibniz)…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We prove that simple, separable, monotracial UHF $L^{p}$-operator algebras are not classifiable up to (complete) isomorphism using countable structures, such as K-theoretic data, as invariants. The same assertion holds even if one only…
We discuss computability of impressions of prime ends of compact sets. In particular, we construct quadratic Julia sets which possess explicitly described non-computable impressions.
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…
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…
In this work we have considered the complexity of the different structures as topological group on Z. We collect some new results, as well as some known results on the group of the integers in order to present: -A family of $2^\cont$…
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.
Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary…