Related papers: Hypercomputing the Mandelbrot Set?
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,…
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…
We give a new proof that all external rays of the Mandelbrot set at rational angles land, and of the relation between the external angle of such a ray and the dynamics at the landing point. Our proof is different from the original one,…
If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…
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 investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…
These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
The combinatorial Mandelbrot set is a continuum in the plane, whose boundary can be defined, up to a homeomorphism, as the quotient space of the unit circle by an explicit equivalence relation. This equivalence relation was described by…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
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…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
Learning meaningful representations that disentangle the underlying structure of the data generating process is considered to be of key importance in machine learning. While disentangled representations were found to be useful for diverse…
A set is low if A' \le_T HALT. A set is superlow if A' \le_tt HALT. A set is superduperlow if A' \le_btt HALT. While it was known that any superduperlow is decidable it does not seem to be well known. We include two unpublished proofs of…
According to the method, suggested in our previous work (nlin/0509012) and based on the consideration of the specially coupled systems, the possibility of physical realization of the phenomena of complex analytic dynamics (such as…
In this paper we prove the following: Take any "small Mandelbrot set" and zoom in a neighborhood of a parabolic or Misiurewicz parameter in it, then we can see a quasiconformal image of a Cantor Julia set which is a perturbation of a…
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…