Related papers: The distribution of ITRM-recognizable reals
We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system…
We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…
Perfect ideals $I$ of grade $3$ in a local ring $(R,\mathfrak{m},\Bbbk)$ can be classified based on multiplicative structures on $\text{Tor}^R_{\bullet}(R/I,\Bbbk)$. The classification is incomplete in the sense that it remains open which…
Modern large language models (LLMs) excel at tasks that require storing and retrieving knowledge, such as factual recall and question answering. Transformers are central to this capability because they can encode information during training…
After reviewing some basic properties of RT algebras, which appear to be the natural framework to deal with integrable systems in presence of an impurity, we show how any integrable system (including these possessing translation invariance)…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
Given a generalist model, learning a task-relevant specialist representation is fundamental for downstream applications. Identifiability, the asymptotic guarantee of recovering the ground-truth representation, is critical because it sets…
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…
Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points (LP). However, LPs often hinder abstraction, and for some algorithms such as the…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…
Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…
Identifiability concerns finding which unknown parameters of a model can be quantified from given input-output data. Many linear ODE models, used in systems biology and pharmacokinetics, are unidentifiable, which means that parameters can…
Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…
We define the indefinite logarithm [log x] of a real number x>0 to be a mathematical object representing the abstract concept of the logarithm of x with an indeterminate base (i.e., not specifically e, 10, 2, or any fixed number). The…
In inverse reinforcement learning (IRL), a learning agent infers a reward function encoding the underlying task using demonstrations from experts. However, many existing IRL techniques make the often unrealistic assumption that the agent…
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…
In a recent paper, Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…