Related papers: Recursion does not always help
Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of…
Let P(n) denote the largest prime factor of $n \ge 2, P(1) = 1$, and let $$ \beta(n) = \sum_{p|n}p, \Beta(n) = \sum_{p^\alpha||n}\alpha p, \Beta_1(n) = \sum_{\p^\alpha||n}p^\alpha $$ denote "large" additive functions. A survey of results on…
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
We compare predictions of the quantum loop expansion to (essentially) infinite orders with (essentially) exact results in a simple quantum mechanical model.We find that there are exponentially small corrections to the loop expansion, which…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
Non-archimedean fields with restricted analytic functions may not support a full exponential function, but they always have partial exponentials defined in convex subrings. On face of this, we study the first order theory of the class of…
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…
The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…
This paper discusses and evaluates ideas of data balancing and data augmentation in the context of mathematical objects: an important topic for both the symbolic computation and satisfiability checking communities, when they are making use…
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…
It is shown that the corrections of $\alpha^2$ order to the total cross sections for interaction of elementary hydrogen-like atoms with target atoms, reported in the previously published paper [S.Mrowczynski, Phys.Rev. D36, 1520 (1987)], do…
We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…
We reformulate the $3x+1$ conjecture by restricting attention to numbers congruent to $2$ (mod $3$). This leads to an equivalent conjecture for positive integers that reveals new aspects of the dynamics of the $3x+1$ problem. Advantages…
Associated Legendre functions of fractional degree appear in the solution of boundary value problems in wedges or in toroidal geometries, and elsewhere in applied mathematics. In the classical case when the degree is half an odd integer,…
The use of a necessity modality in a typed $\lambda$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and…
The ability to perform arithmetic tasks is a remarkable trait of human intelligence and might form a critical component of more complex reasoning tasks. In this work, we investigate if the surface form of a number has any influence on how…
We introduce the notion of feedback computable functions from $2^\omega$ to $2^\omega$, extending feedback Turing computation in analogy with the standard notion of computability for functions from $2^\omega$ to $2^\omega$. We then show…
Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…