Related papers: Martin's Conjecture in the Enumeration Degrees
We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…
A functional analog of the Klain-Schneider theorem for vector-valued valuations on convex functions is established, providing a classification of continuous, translation covariant, simple valuations. Under additional rotation equivariance…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
In this paper, we study the relationship of parametrised enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results…
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…
We present a case study in {\it experimental} yet {\it rigorous} mathematics by describing an algorithm, fully implemented in both Mathematica and Maple, that {\it automatically conjectures}, and then {\it automatically proves}, closed-form…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…
Prices of tradables can only be expressed relative to each other at any instant of time. This fundamental fact should therefore also hold for contigent claims, i.e. tradable instruments, whose prices depend on the prices of other tradables.…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real…
A function $J$ defined on a family $C$ of stationary processes is finitely observable if there is a sequence of functions $s_n$ such that $s_n(x_1 ... x_n)\to J(X)$ in probability for every process $X=(x_n)\in C$. Recently, Ornstein and…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
Recent work on the quantization of Maxwell theory has used a non-covariant class of gauge-averaging functionals which include explicitly the effects of the extrinsic-curvature tensor of the boundary, or covariant gauges which, unlike the…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that…
We define a class of motivic equivalences of small stable $\infty$-categories $W_{\mathrm{mot}}$ and show that the Dwyer--Kan localization functor $\mathrm{Cat}^{\mathrm{perf}}_\infty \to…
Beurling slow variation is generalized to Beurling regular variation. A Uniform Convergence Theorem, not previously known, is proved for those functions of this class that are measurable or have the Baire property. This permits their…