Related papers: The typical Turing degree
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
There are two objectives to this work: to classify all tame integer tilings and to classify all tame integer hypertilings. Motivation for the first objective comes from Conway and Coxeter's modelling of positive integer friezes using…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
The present paper, though inspired by the use of tensor hierarchies in theoretical physics, establishes their mathematical credentials, especially as genetically related to Lie algebra crossed modules. Gauging procedures in supergravity…
A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…
The regularity of the Rees ring of the edge ideal of a finite simple graph is studied. We show that the matching number is a lower and matching number~$+1$ is an upper bound of the regularity, if the Rees algebra is normal. In general the…
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be computed when the set is given in one of the following three…
Gyenis and Redei have demonstrated that any prior p on a finite algebra, however chosen, severely restricts the set of posteriors accessible from p by Jeffrey conditioning on a nontrivial partition. Their demonstration involves showing that…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
The Arthur-Nimue-Merlin degrees are a generalization of the Turing degrees introduced by Kihara as a tangible description of the partially ordered set of Lawvere-Tierney topologies on the effective topos (equivalently, subtoposes of the…
We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…
This paper proposes a new metric to measure the calibration error of probabilistic binary classifiers, called test-based calibration error (TCE). TCE incorporates a novel loss function based on a statistical test to examine the extent to…
Even if a ring A is coherent, the polynomial ring A[X] in one variable could fail to be coherent. In this note we show that A[X] is graded coherent with the standard grading deg X=1. More generally, we give a criterion of graded…
For two ideals $I$ and $J$ of a noetherian ring, we characterize, in terms of the vanishing of Tor modules, when the associated graded ring of the sum $I+J$ is isomorphic to the tensor product of the associated graded ring of $I$ and the…
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…
We characterize $\tau$-tilting modules as $1$-tilting modules over quotient algebras satisfying a tensor-vanishing condition, and characterize $1$-tilting modules as $\tau$-tilting modules satisfying a ${\rm Tor}^1$-vanishing condition. We…