Related papers: Recursion does not always help

For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…

We study certain algebras of theta-like functions on partitions, for which the corresponding generating functions give rise to theta functions, quasi-Jacobi forms, Appell-Lerch sums, and false theta functions.

We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…

We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…

We study flat deformations of quotients of a polynomial algebra in a class of graded commutative associative algebras. Functional equations and their solutions in terms of theta functions play important role in these studies. An analog of…

We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…

Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

We study the concept of extended derivations of algebras which expands diverse definitions of generalized derivations given in the literature. We concentrate on the family of the anti-commutative algebras and classify such spaces of…

We consider strictly increasing sequences $\left(a_{n}\right)_{n \geq 1}$ of integers and sequences of fractional parts $\left(\left\{a_{n} \alpha\right\}\right)_{n \geq 1}$ where $\alpha \in \mathbb{R}$. We show that a small additive…

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

This paper generalizes for non-abelian theta functions a number of formulae valid for theta functions of Jacobian varieties. The addition formula, the relation with the Szego kernel and with the multicomponent KP hierarchy and the behavior…

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

Fractional derivatives are generalization to classical integer-order derivatives. The rules which are true for classical derivative need not hold for the fractional derivatives, for example, we cannot simply add the fractional orders…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

Expansions of abelian categories are introduced. These are certain functors between abelian categories and provide a tool for induction/reduction arguments. Expansions arise naturally in the study of coherent sheaves on weighted projective…

A new interpretation of zeta functions is given for F1-schemes which do not satisfy Soul\'e's condition. Functional equations for reductive groups are computed and a new definition of zeta functions attached to more general counting…

Using a human-oriented formal example proof of the (lim+) theorem, i.e. that the sum of limits is the limit of the sum, which is of value for reference on its own, we exhibit a non-permutability of beta-steps and delta+-steps (according to…

Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic…

A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…