Related papers: Nearly Computable Real Numbers
We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
A topological space $X$ is called almost discrete, if it has precisely one nonisolated point. In this paper, we get that for a countable product $X=\prod X_i$ of almost discrete spaces $X_i$ the space $C_p(X)$ of continuous real-valued…
We consider the Cauchy problem for the nonlinear Schr\"{o}dinger equation with derivative nonlinearity $(i\partial _t + \Delta ) u= \pm \partial (\overline{u}^m)$ on $\R ^d$, $d \ge 1$, with random initial data, where $\partial$ is a first…
It is a ubiquitous opinion among mathematicians that a real number is just a point in the line. If this rough definition is not enough, then a mathematician may provide a formal definition of the real numbers in the set theoretic and…
We call a subset $A$ of an abelian topological group $G$: (i) $absolutely$ $Cauchy$ $summable$ provided that for every open neighbourhood $U$ of $0$ one can find a finite set $F\subseteq A$ such that the subgroup generated by $A\setminus F$…
We study the growth rate of the inclusion length of an almost periodic function. For a given a. p. function such growth rate depends on the algebraic structure of Fourier exponents, i. e. on how good they can be approximated by rational…
Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model introduced by Buhrman et al. (2014). Motivated by the…
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…
Given a strictly increasing sequence of positive real numbers tending to infinity $(q_{n})_{n=1}^{\infty}$, and an arbitrary sequence of real numbers $(r_{n})_{n=1}^{\infty}.$ We study the set of $\alpha\in(1,\infty)$ for which…
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
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…
Let $X$ be a (data) set. Let $K(x,y)>0$ be a measure of the affinity between the data points $x$ and $y$. We prove that $K$ has the structure of a Newtonian potential $K(x,y)=\varphi(d(x,y))$ with $\varphi$ decreasing and $d$ a quasi-metric…
We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
In 1984, K. Mahler asked how well elements in the Cantor middle third set can be approximated by rational numbers from that set, and by rational numbers outside of that set. We consider more general missing digit sets $C$ and construct…
We introduce the notion of {\it approximation type} for the partial, and in certain cases the total description of extensions of a given valuation from a field $K$ to the rational function field $K(x)$. To every extension, a unique…