Related papers: Recursive definitions on surreal numbers
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to…
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…
We study how the orbits of the singularities of the inverse of a meromorphic function prescribe the dynamics on its Julia set, at least up to a set of (Lebesgue) measure zero. We concentrate on a family of entire transcendental functions…
Conway's surreal numbers were aptly named by Knuth. This note examines how far one can get towards implementing surreals and the arithmetic operations on them so that they execute efficiently. Lazy evaluation and recursive data structures…
The aim of this work is to provide formulae for the subdifferential and the conjungate function of the supremun function over an arbitrary family of functions. The work is principally motivated by the case when data functions are lower…
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…
We propose a novel definition of Fourier transform, with the property that the transform of a real function is again a real function (without doubling the number of real components). We prove the inversion theorem for the novel definition,…
We study the class $\mathcal{M}$ of functions meromorphic outside a countable closed set of essential singularities. We show that if a function in $\mathcal{M}$, with at least one essential singularity, permutes with a non-constant rational…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
We examine recursive monotonic functions on the Lindenbaum algebra of $\mathsf{EA}$. We prove that no such function sends every consistent $\varphi$ to a sentence with deductive strength strictly between $\varphi$ and…
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's…
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
We make a number of observations on Conway surreal number theory which may be useful, for further developments, in both in mathematics and theoretical physics. In particular, we argue that the concepts of surreal numbers and matroids can be…
If F is an infinitely differentiable function whose composition with a blowing-up belongs to a Denjoy-Carleman class C_M (determined by a log convex sequence M=(M_k)), then F, in general, belongs to a larger shifted class C_N, where N_k =…
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…
Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…