Related papers: Low functions of reals
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Let $\alpha \in \mathbb{C}$ be an exponential period. We show that the real and imaginary part of $\alpha$ are up to signs volumes of sets definable in the o-minimal structure generated by $\mathbb{Q}$, the real exponential function and…
In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (ODE), also known as finite differences. Doing so, we pointed…
In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
We study the structure of an algebraically closed field with extra function resembling the classical exponentiation on complex numbers.
A class of rational functions characterized by some wonderful properties is studied. The properties that identify this class include simple algebra (their inverses can be expressed in radicals), simple topology (the total space of the…
It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.
The periods, introduced by Kontsevich and Zagier, form a class of complex numbers which contains all algebraic numbers and several transcendental quantities. Little has been known about qualitative properties of periods. In this paper, we…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
Pseudoexponential fields are exponential fields similar to complex exponentiation satisfying the Schanuel Property, which is the abstract statement of Schanuel's Conjecture, and an adapted form of existential closure. Here we show that if…
We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…
We introduce and discuss a new class of (multivalued analytic) transcendental functions which still share with algebraic functions the property that the number of their isolated zeros can be explicitly counted. On the other hand, this class…
We define reduced zeta functions of Lie algebras, which can be derived from motivic zeta functions using the Euler characteristic. We show that reduced zeta functions of Lie algebras possessing a suitably well-behaved basis are easy to…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…