Related papers: 27 Open Problems in Kolmogorov Complexity
We introduce a notion of Kolmogorov complexity of unitary transformation, which can (roughly) be understood as the least possible amount of information required to fully describe and reconstruct a given finite unitary transformation. In the…
I discuss several aspects of information theory and its relationship to physics and neuroscience. The unifying thread of this somewhat chaotic essay is the concept of Kolmogorov or algorithmic complexity (Kolmogorov Complexity, for short).…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems…
We study in which way Kolmogorov complexity and instance complexity affect properties of r.e. sets. We show that the well-known 2log n upper bound on the Kolmogorov complexity of initial segments of r.e.\ sets is optimal and characterize…
The Kolmogorov complexity function K can be relativized using any oracle A, and most properties of K remain true for relativized versions. In section 1 we provide an explanation for this observation by giving a game-theoretic interpretation…
We present 35 open problems on combinatorial, geometric and algebraic aspects of k-orbit abstract polytopes. We also present a theory of rooted polytopes that has appeared implicitly in previous work but has not been formalized before.
We introduce a method for analyzing the complexity of natural language processing tasks, and for predicting the difficulty new NLP tasks. Our complexity measures are derived from the Kolmogorov complexity of a class of automata --- {\it…
For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.
A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that the matrix is…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
We establish diverse relationships between the algorithmic (Kolmogorov) complexity of the prefixes of any binary expansion and $\beta$-expansions. These relationships allow to develop intuitions on the complexity behavior of…
This is the list of open problems in topological algebra posed on the conference dedicated to the 20th anniversary of the Chair of Algebra and Topology of Lviv National University, that was held on 28 September 2001.
We propose a list of open problems in numerical semigroups.
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems,…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the applications involve heuristic approximations. Perhaps…
Recently, many results on the computational complexity of sorting algorithms were obtained using Kolmogorov complexity (the incompressibility method). Especially, the usually hard average-case analysis is ammenable to this method. Here we…
In this paper some open problems for Painlev\'e equations are discussed. In particular the following open problems are described: (i) the Painlev\'e equivalence problem; (ii) notation for solutions of the Painlev\'e equations; (iii)…
In this paper, we present the solution to Kolmogorov's problem for the classes of multiply monotone and completely monotone functions together with its connections to the Markov moment problem, Hermite-Birkhoff interpolation problem, and…