相关论文: Hypercomputing the Mandelbrot Set?

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…

In this paper we explore a connection between descriptive set theory and inner model theory. From descriptive set theory, we will take a countable, definable set of reals, A. We will then show that A is equal to the reals of M, where M is a…

The authors have been using a largely algebraic form of ``computational discovery'' in various undergraduate classes at their respective institutions for some decades now to teach pure mathematics, applied mathematics, and computational…

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…

We consider perturbations of the complex quadratic map $ z \to z^2 +c$ and corresponding changes in their quasi-Mandelbrot sets. Depending on particular perturbation, visual forms of quasi-Mandelbrot set changes either sharply (when the…

This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two…

Mandelbrot set arose from the pioneering work of French mathematician Gaston Julia in the field of complex dynamics at the beginning of the 20th century. French-American mathematician Benoit Mandelbrot used computers to calculate iterations…

Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First, we show that, for each natural number d, an oracle for the set of algebraic real numbers of degree at most d is…

We consider the "Mandelbrot set" $M$ for pairs of complex linear maps, introduced by Barnsley and Harrington in 1985 and studied by Bousch, Bandt and others. It is defined as the set of parameters $\lambda$ in the unit disk such that the…

The theory that all processes in the universe are computational is attractive in its promise to provide an understandable theory of everything. I want to suggest here that this pancomputationalism is not sufficiently clear on which problem…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

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…

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…

A celebrated 1969 theorem of Michael Rabin is that the MSO theory of the real order where the monadic quantifier is allowed only to range over the sets of rational numbers, is decidable. In 1975 Saharon Shelah proved that if the monadic…

The classical simulation of physical processes using standard models of computation is fraught with problems. On the other hand, attempts at modelling real-world computation with the aim of isolating its hypercomputational content have…

Mandelbrot set is a closure of the set of zeroes of $resultant_x(F_n,F_m)$ for iterated maps $F_n(x)=f^{\circ n}(x)-x$ in the moduli space of maps $f(x)$. The wonderful fact is that for a given $n$ all zeroes are not chaotically scattered…

We introduce a lightweight and accessible approach to computation over the real numbers, with the aim of clarifying both the underlying concepts and their relevance in modern research. The material is intended for a broad audience,…

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…

To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…