Related papers: The Lost Melody Phenomenon
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
We consider a model identification problem in which an outcome variable contains nonignorable missing values. Statistical inference requires a guarantee of the model identifiability to obtain estimators enjoying theoretically reasonable…
Spectral properties of Toeplitz operators and their finite truncations have long been central in operator theory. In the finite dimensional, non-normal setting, the spectrum is notoriously unstable under perturbations. Random perturbations…
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite ($*$-finite) number of bits while keeping the finite…
We speculate whether the second law of thermodynamics has more to do with Turing machines than steam pipes. It states the logical reversibility of reality as a computation, i.e., the fact that no information is forgotten: nature computes…
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…
Instruction sequence is a key concept in practice, but it has as yet not come prominently into the picture in theoretical circles. This paper concerns instruction sequences, the behaviours produced by them under execution, the interaction…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Deterministic two-way transducers define the class of regular functions from words to words. Alur and Cern\'y introduced an equivalent model of transducers with registers called copyless streaming string transducers. In this paper, we drop…
Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every…
In this paper, we analyze several instrumental records of temperatures at different locations by using new techniques originally developed for the analysis of extreme values of dynamical systems. We show that they have the same recurrence…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
We prove the Second Vanishing Theorem for local cohomology modules of an unramified regular local ring in its full generality and provide a new proof of the Second Vanishing Theorem in prime characteristic $p$. As an application of our…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
Inherently interpretable machine learning (IML) models offer valuable support for clinical decision-making but face challenges when features contain missing values. Traditional approaches, such as imputation or discarding incomplete…
We show that a computable function $f:\mathbb R\rightarrow\mathbb R$ has Luzin's property (N) if and only if it reflects $\Pi^1_1$-randomnes, if and only if it reflects $\Delta^1_1(\mathcal O)$-randomness, and if and only if it reflects…
We introduce and investigate forgetting 1-limited automata, which are single-tape Turing machines that, when visiting a cell for the first time, replace the input symbol in it by a fixed symbol, so forgetting the original contents. These…