Related papers: Solovay functions and their applications in algori…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
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…
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
Martin-L\"of (ML)-reducibility compares $K$-trivial sets by examining the Martin-L\"of random sequences that compute them. We show that every $K$-trivial set is computable from a c.e.\ set of the same ML-degree. We investigate the interplay…
We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently sized random subsets of strings are guaranteed to have two members x and y with low K(x/y). To prove this, we first show that the minimum conditional Kolmogorov…
A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…
We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) -…
In the paper we consider the one-frequency cohomological equation \begin{equation*} (\partial_x + \omega \partial_y) g(x,y) = a(x,y) \end{equation*} on the 2-torus with unknown $g$ and analytic initial data $a$. We identify all the…
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…
Colombeau generalized functions invariant under smooth (additive) one-parameter groups are characterized. This characterization is applied to generalized functions invariant under orthogonal groups of arbitrary signature, such as groups of…
According to a program of Braverman, Kazhdan and Ng\^o Bao Ch\^au, for a large class of split unramified reductive groups $G$ and representations $\rho$ of the dual group $\hat{G}$, the unramified local $L$-factor $L(s,\pi,\rho)$ can be…
The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton…
We give simplify the proofs of the 2 results in Marius Zimand's paper "Kolmogorov complexity version of Slepian-Wolf coding, proceedings of STOC 2017, p22--32". The first is a universal polynomial time compression algorithm: on input…
Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e…
A class of rational functions characterized by some wonderful properties is studied. The properties that identify this class include simple algebra (their inverses can be expressed in radicals), simple topology (the total space of the…
This paper introduces a new generalized superfactorial function (referable to as $n^{th}$- degree superfactorial: $sf^{(n)}(x)$) and a generalized hyperfactorial function (referable to as $n^{th}$- degree hyperfactorial: $H^{(n)}(x)$), and…
The Kolmogorov axioms for probability functions are placed in the context of signed meadows. A completeness theorem is stated and proven for the resulting equational theory of probability calculus. Elementary definitions of probability…
The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this…
In 2011, Sok\'{o}{\l} (Comput. Math. Appl. 62, 611--619) introduced and studied the class $\mathcal{SK}(\alpha)$ as a certain subclass of starlike functions, consists of all functions $f$ ($f(0)=0=f'(0)-1$) which satisfy in the following…
We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…