Related papers: Computability of Brjuno-like functions
Non standard analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical analysis can be expressed very naturally. Cheap non-standard analysis introduced by…
So far, following the works of A.M. Turing, the algorithms were considered as the mathematical abstraction from which we could write programs for computers whose principle was based on the theoretical concept of Turing machine. We start…
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…
Non-monotone inductive definitions were studied in the late 1960's and early 1970's with the aim of understanding connections between the complexity of the formulas defining the induction steps and the size of the ordinals measuring the…
This paper constructively proves the existence of an effective procedure generating a computable (total) function that is not contained in any given effectively enumerable set of such functions. The proof implies the existence of machines…
The method of Tur\'an in establishing the normal order for the number of prime divisors of a number is used to show that a certain class of arithmetic functions do not have a normal order.
$\sigma$-Brjuno functions were introduced in \cite{MaMoYo_06} as an interesting variant of the classical Brjuno function, where one substitutes the $\log$ singularity at $x=0$ with the power law divergence $x^{-1/\sigma},$ $(\sigma>0).$ As…
Nonlinear balanced truncation is a model order reduction technique that reduces the dimension of nonlinear systems in a manner that accounts for either open- or closed-loop observability and controllability aspects of the system. A…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
This paper describes Turing's Halting Problem (HP), and reviews the classic proof that no function exists that can solve HP. The concept of a "Context-Dependent Function" (CDF), whose behavior varies based on seemingly irrelevant changes to…
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative.…
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
A typical phenomenon for machine models of transfinite computations is the existence of so-called lost melodies, i.e. real numbers $x$ such that the characteristic function of the set $\{x\}$ is computable while $x$ itself is not (a real…
The Brjuno and Wilton functions bear a striking resemblance, despite their very different origins; while the Brjuno function $B(x)$ is a fundamental tool in one-dimensional holomorphic dynamics, the Wilton function $W(x)$ stems from the…
For \alpha in the interval [0,1], we consider the one-parameter family of \alpha-continued fraction maps, which include the Gauss map (\alpha=1) and the nearest integer (\alpha=1/2) and by-excess (\alpha=0) continued fraction maps. To each…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new…
The principle goal of computational mechanics is to define pattern and structure so that the organization of complex systems can be detected and quantified. Computational mechanics developed from efforts in the 1970s and early 1980s to…
We investigate the Church-Kalm\'ar-Kreisel-Turing Theses concerning theoretical (necessary) limitations of future computers and of deductive sciences, in view of recent results of classical general relativity theory. We argue that (i) there…