Related papers: Recursive definitions on surreal numbers

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…

A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…

It is well-known that the notion of limit in the sharp topology of sequences of Colombeau generalized numbers $\widetilde{\mathbb{R}}$ does not generalize classical results. E.g.~the sequence $\frac{1}{n}\not\to0$ and a sequence…

A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…

Given a finite and non-empty set $X$ and randomly selected specific functions and relations on $X$, we investigate the existence and non-existence of fixed points and reflexive points, respectively. First, we consider the class of…

A function is strongly non-recursive (SNR) if it is eventually different from each recursive function. We obtain hierarchy results for the mass problems associated with computing such functions with varying growth bounds. In particular,…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…

We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…

A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…

We show that an exponential map $f_c(z)=e^z+c$ whose singular value $c$ is combinatorially non-recurrent and non-escaping is uniquely determined by its combinatorics, i.e. the pattern in which its dynamic rays land together. We do this by…

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure…

We construct and study the class of continuous on $[0, 1]$ functions with continuum set of peculiarities (singular, nowhere monotonic, and non-differentiable functions are among them). The representative of this class is the function…

Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that…

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…