Related papers: Solovay functions and their applications in algori…
It is well known that normality can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of "lossless finite-state compressors" do not follow…
A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way…
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
Outside of the left-c.e. reals, Solovay reducibility is considered to be behaved badly [10.1007/978-0-387-68441-3]. Proposals for variants of Solovay reducibility that are better suited for the investigation of arbitrary, not necessarily…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
While Kolmogorov's probability axioms are widely recognized, it is less well known that in an often-overlooked 1930 note, Kolmogorov proposed an axiomatic framework for a unifying concept of the mean -- referred to as regular means. This…
The objective of this study is a better understanding of the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the distance of two real numbers. We characterize Solovay reduction…
A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. Moreover, when strings are short, the dependence of K on a particular…
We show that the classical kernel and domain functions associated to an n-connected domain in the plane are all given by rational combinations of three or fewer holomorphic functions of one complex variable. We characterize those domains…
In this note we show that sharp Kolmogorov-type inequalities that estimate the uniform norm $\|f^{(k)}\|$ of the $k$-th derivative of a function $f\colon \mathbb{R}\to\mathbb{R}$ by the values of the uniform norm of $f$ and uniform norms of…
In an attempt to demonstrate that local hidden variables are mathematically possible, Pitowsky constructed "spin-$\frac12$ functions" and later "Kolmogorovian models", which employs a nonstandard notion of probability. We describe…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…
The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…
Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to…
In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking…
$CMO$ functions are completely multiplicative functions $f$ for which $\sum_{n=1}^\infty f(n)$ $=0$. These functions were first introduced and studied by Kahane and Sa\"{i}as [5]. The main purpose of this paper is to generalise such…
The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the…
In a recent paper [Trans. Amer. Math. Soc. 378 (2025), 851-883], the concept of generalized partial-slice monogenic (or regular) function was introduced over Clifford algebras. The present paper shall extend the study of generalized…
It is impossible to effectively modify a string in order to increase its Kolmogorov complexity. But is it possible to construct a few strings, not longer than the input string, so that most of them have larger complexity? We show that the…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…