Related papers: Hypercomputing the Mandelbrot Set?

Johansson, Jordan, \"Oberg and Pollicott ( Israel J. Math.(2010)) has studied the multifractal analysis of a class of one-dimensional non-uniformly hyperbolic systems, by introducing some new techniques, we extend the results to the case of…

The notion of generic reducibility was introduced by A.Rybalov in his CiE 2018 paper: a set A is generically reducible to set B if there exists a total computable function f that m-reduces A to B such that the f-preimage of every set that…

We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…

Symmetries impose structure on the Hilbert space of a quantum mechanical model. The mathematical units of this structure are the irreducible representations of symmetry groups and I consider how they function as conceptual units of…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

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,…

Let $f(z) = z^2 + c$ be a quadratic polynomial, with c in the Mandelbrot set. Assume further that both fixed points of f are repelling, and that f is not renormalizable. Then we prove that the Julia set J of f is holomorphically removable…

In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Han\v{c}l and Rucki \cite{hancl3}.

The importance of explainability in machine learning continues to grow, as both neural-network architectures and the data they model become increasingly complex. Unique challenges arise when a model's input features become high dimensional:…

In 1960's I. Gelfand posed a problem: describe indecomposable representations of any simple infinite dimensional Lie algebra of polynomial vector fields. Here, by applying the elementary technique of Gelfand and Ponomarev, a toy model of…

The (complex) two-qubit systems comprise a 15-dimensional convex set and the real two-qubit systems, a 9-dimensional convex set. While formulas for the Hilbert-Schmidt volumes of these two sets are known -- owing to recent important work of…

We prove the decoration theorem for the Mandelbrot set (and Multibrot sets) which says that when a "little Mandelbrot set" is removed from the Mandelbrot set, then most of the resulting connected components have small diameters.

A key point in Douady and Hubbard's study of the Mandelbrot set $M$ is the theorem that every parabolic point $c\ne 1/4$ in $M$ is the landing point for exactly two external rays with angle which are periodic under doubling. This note will…

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

In the article at hand, we sketch how, by utilizing nilpotency to its fullest extent (Engel, Super Engel) while using methods from the theory of universal enveloping algebras, a complete description of the indecomposable representations may…

Representation learning is the foundation for the recent success of neural network models. However, the distributed representations generated by neural networks are far from ideal. Due to their highly entangled nature, they are di cult to…

This is a review of concepts of noncommutative supergeometry - namely Hilbert superspace, C*-superalgebra, quantum supergroup - and corresponding results. In particular, we present applications of noncommutative supergeometry in harmonic…