Related papers: A Rice-like theorem for primitive recursive functi…
We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function. These pointer recursive functions classes are proven equivalent…
In this paper, we extend Busy Beaver function to a class of higher order Busy Beaver functions based on Turing oracle machine. We prove some results about the relation between decidability of number theoretical formula and higher order Busy…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Logic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the…
We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…
In this article we present certain formulas involving arithmetical functions. In the first part we study properties of sums and product formulas for general type of arithmetic functions. In the second part we apply these formulas to the…
Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering.…
Abstract models of computation often treat the successor function $S$ on $\mathbb{N}$ as a primitive operation, even though its low-level implementations correspond to non-trivial programs operating on specific numerical representations.…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
The purpose of this paper is to introduce the notion of Nash functions in the context of slice regular functions of one quaternionic or octonionic variable. We begin with a detailed analysis of the possible definitions of Nash slice regular…
By restricting the variables running over various (possibly different) subfields, we introduce the notion of a partial zeta function. We prove that the partial zeta function is rational in an interesting case, generalizing Dwork's well…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
Based on operators borrowed from scattering theory, several concrete realizations of index theorems are proposed. The corresponding operators belong to some C*-algebras of pseudo-differential operators with coefficients which either have…
Let $W$ be a subset of the set of real points of a real algebraic variety $X$. We investigate which functions $f: W \to \mathbb R$ are the restrictions of rational functions on $X$. We introduce two new notions: ${\it curve-rational \,…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
Rice's theorem states that no non-trivial semantic property of programs is decidable. Classical proofs proceed by reduction from the halting problem, invoking the law of excluded middle (LEM) twice: once through diagonalization, and once…
Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the…