Related papers: The semaphore codes attached to a Turing machine v…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…
We develop a new approach to random walks on de Bruijn graphs over the alphabet $A$ through right congruences on $A^k$, defined using the natural right action of $A^+$. A major role is played by special right congruences, which correspond…
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a…
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…
An $\alpha$-approximate polynomial Turing kernelization is a polynomial-time algorithm that computes an $(\alpha c)$-approximate solution for a parameterized optimization problem when given access to an oracle that can compute…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…
Given a bounded sequence $\{X^{n}\}_{n}$ of semimartingales on a time interval $[0,T]$, we find a sequence of convex combinations $\{Y^{n}\}_{n}$ and a limiting semimartingale $Y$ such that $\{Y^{n}\}_{n}$ converges to $Y$ in a…
For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semi-decidable decision problems over the reals. In order to refine, step-by-step, a…
We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps $T_\alpha$ using the full parameter range $0<…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with…