Related papers: Inherent enumerability of strong jump-traceability

We show that part I of uniform Martin's conjecture follows from a local phenomenon, namely that if a non-constant Turing invariant function goes from the Turing degree $\boldsymbol x$ to the Turing degree $\boldsymbol y$, then $\boldsymbol…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…

In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…

Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

In this paper we study structural properties of LV-degrees of the algebra of collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. We construct atoms…

Michael asked whether every productively Lindel\"of space is powerfully Lindel\"of. Building of work of Alster and De la Vega, assuming the Continuum Hypothesis, we show that every productively Lindel\"of space of countable tightness is…

For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.

The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church-Turing computability), non-inductive and…

Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…

An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably…

As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of…

Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…

Runtime predictive analyses enhance coverage of traditional dynamic analyses based bug detection techniques by identifying a space of feasible reorderings of the observed execution and determining if any of these witnesses the violation of…

We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive…

This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…