Related papers: A recursive function coding number theoretic funct…
We consider approximations of a continuous function on a countable normed Fr\'{e}chet space by analytic and $*$-analytic. Also we found a criterium of the existence of an extension of a continuous function from a dense subspace of a…
We consider the task of computing functions $f: \mathbb{N}^k\to \mathbb{N}$, where $ \mathbb{N}$ is the set of natural numbers, by finite teams of agents modelled as deterministic finite automata. The computation is carried out in a…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
In the present paper we study stability of recurrence equations (which in particular case contain a dynamics of rational functions) generated by contractive functions defined on an arbitrary non-Archimedean algebra. Moreover,…
We prove a recursion formula for generating functions of certain renormalizations of *-moments of the DT(\delta_0,1)-operator T, involving an operation \odot on formal power series and a transformation E that converts \odot to usual…
Nekrasov partition function for the supersymmetric gauge theories with general Lie groups is not so far known in a closed form while there is a definition in terms of the integral. In this paper, as an intermediate step to derive it, we…
We introduce a new, demand-driven variant of Spector's bar recursion in the spirit of the Berardi-Bezem-Coquand functional. The recursion takes place over finite partial functions $u$, where the control parameter $\varphi$, used in…
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. LCF is an interactive theorem-prover intended for reasoning about computation. Its implementation of…
The recursion theorem in the weak form {e}(z)=x(e,z) (universal function not needed) and in Rogers form {n}(z)={{x}(n)}(z) and Rice theorem are proved a first time using programs in C, and a second time with scripts in Bash.
In this work, we study vector-valued functional equations with multiple recursive terms that arise naturally when we are dealing with vector-valued multiplicative Lindley-type recursions. We provide a detailed framework for the solution of…
Let $\Lambda$ be a countable index set and $S=\{\phi_i: i\in \Lambda\}$ be a conformal iterated function system on $[0,1]^d$ satisfying the open set condition. Denote by $J$ the attractor of $S$. With each sequence $(w_1,w_2,...)\in…
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming…
In previous papers, for an arithmetical function $f_0$, we defined functions $f_m$ and $c_m$ and designated numbers of restricted words over a finite alphabet counted by these functions. In this paper, we examine the reverse problem for…
A parking function is a sequence of N nonnegative integers majorated by a permutation of the set {0, ..., N-1}. We provide a way to encode parking functions by data suggested by J.Haglund and N.Loehr. This coding is compared with another…
The recursive relation for the 1-point conformal block on a torus is derived and used to prove the identities between conformal blocks recently conjectured by R. Poghossian. As an illustration of the efficiency of the recurrence method the…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our…
For a set $A$ of non-negative integers, let $R_A(n)$ denote the number of solutions to the equation $n=a+a'$ with $a$, $a'\in A$. Denote by $\chi_A(n)$ the characteristic function of $A$. Let $b_n>0$ be a sequence satisfying $\limsup_{n\to…