Related papers: Highness properties close to PA-completeness
Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
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…
We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…
We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of…
We investigate homological properties of perfect algebras of prime characteristic. The principle is as follows: perfect algebras resolve the singularities. For example, we show any module over the ring of absolute integral closure has…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
We associate two almost $C_p$-representations to a $(\phi,\Gamma)$-module, and we compute their dimensions and heights. As a corollary, we get a full faithfulness result for $B_e$-representations.
A property of a system is called actual, if the observation of the test that pertains to that property, yields an affirmation with certainty. We formalize the act of observation by assuming that the outcome correlates with the state of the…
Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…
From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…
Robust Principal Component Analysis (PCA) (Candes et al., 2011) and low-rank matrix completion (Recht et al., 2010) are extensions of PCA to allow for outliers and missing entries respectively. It is well-known that solving these problems…
This paper deals with three tools to compare proof-theoretic strength of formal arithmetical theories: interpretability, $\Pi^0_1$-conservativity and proving restricted consistency. It is well known that under certain conditions these three…
Certain countably and finitely additive measures can be associated to a given nonnegative supermartingale. Under weak assumptions on the underlying probability space, existence and (non)uniqueness results for such measures are proven.
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far…
Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…