Related papers: Recursion does not always help

The parametric equations of the surfaces on which highly resonant quasi-periodic motions develop (lower-dimensional tori) cannot be analytically continued, in general, in the perturbation parameter, i.e. they are not analytic functions of…

We give some experimental observations on the growth of the norm of certain matrices related to the Mertens function. The results obtained in these experiments convince us that linear algebra may help in the study of Mertens function and…

We present a study of the problem of finiteness of the $\beta$-expansions for the set of natural numbers, condition $F_1$ in brief, for three families of Pisot numbers for which the $\beta$-expansion of 1 is not a non-decreasing sequence.…

It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms. In…

We show that free objects on sets do not exist in the category $bal$ of bounded archimedean $\ell$-algebras. On the other hand, we introduce the category of weighted sets and prove that free objects on weighted sets do exist in $bal$. We…

We explore \emph{semibounded} expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We introduce the notion of a \emph{semibounded} expansion of an arbitrary ordered group, extending…

Automatically solving math word problems is a critical task in the field of natural language processing. Recent models have reached their performance bottleneck and require more high-quality data for training. We propose a novel data…

Substitution resolution supports the computational character of $\beta$-reduction, complementing its execution with a capture-avoiding exchange of terms for bound variables. Alas, the meta-level definition of substitution, masking a…

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

This paper presents the equality of finite index sums of Bessel func- tions containing arbitrary numbers of terms. These reduce to the familiar three term recursion formulas in simple cases.

We give an example of a set $\Omega \subset \R^5$ which is a finite union of unit cubes, such that $L^2(\Omega)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\Omega|^{1/2}} e^{2\pi i \xi_j \cdot x}: \xi_j \in \Lambda \}$ for…

We view the neat reduct operator as a functor that lessens dimensions from CA_{\alpha+\omega} to CA_{\alpha} for infinite ordinals \alpha. We show that this functor has no right adjoint. Conversely for polyadic algebras, and several reducts…

A model of computation is abstract if, when applied to any algebra, the resulting programs for computable functions and sets on that algebra are invariant under isomorphisms, and hence do not depend on a representation for the algebra.…

The classical limit of the scaled elliptic algebra $A_{\hbar,\eta}(sl_2)$ is investigated. The limiting Lie algebra is described in two equivalent ways: as a central extension of the algebra of generalized automorphic $sl_2$ valued…

Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…

Classifier calibration does not always go hand in hand with the classifier's ability to separate the classes. There are applications where good classifier calibration, i.e. the ability to produce accurate probability estimates, is more…

We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…

Treating differentials as independent algebraic units have a long history of use and abuse. It is generally considered problematic to treat the derivative as a fraction of differentials rather than as a holistic unit acting as a limit,…

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…