Related papers: Topological arguments for Kolmogorov complexity
We consider dynamical systems for which the spatial extension plays an important role. For these systems, the notions of attractor, epsilon-entropy and topological entropy per unit time and volume have been introduced previously. In this…
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The…
We utilize classical facts from topology to show that the classification problem in machine learning is always solvable under very mild conditions. Furthermore, we show that a softmax classification network acts on an input topological…
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…
We explore the topology of configuration spaces of hard disks experimentally, and show that several changes in the topology can already be observed with a small number of particles. The results illustrate a theorem of Baryshnikov, Bubenik,…
Two information structures are said to be close if, with high probability, there is approximate common knowledge that interim beliefs are close under the two information structures. We define an "almost common knowledge topology" reflecting…
Understanding how singularities behave under small perturbations is a central theme in singularity theory. In this paper we establish sufficient conditions for families of analytic function-germs on a germ of a complex analytic space to…
Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the…
The normalized information distance is a universal distance measure for objects of all kinds. It is based on Kolmogorov complexity and thus uncomputable, but there are ways to utilize it. First, compression algorithms can be used to…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
Kolmogorov's invariant torus theorem is proved using a simple fixed point theorem.
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…
Let $\Omega$ be a smooth real analytic submanifold of a complex manifold $X$. We establish and study the link between the following 3 subjects: 1) topological properties of smooth families of attached analytic discs, the manifold $\Omega$…
We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
The even online Kolmogorov complexity of a string $x = x_1 x_2 \cdots x_{n}$ is the minimal length of a program that for all $i\le n/2$, on input $x_1x_3 \cdots x_{2i-1}$ outputs $x_{2i}$. The odd complexity is defined similarly. The sum of…
For each partition of a data set into a given number of parts there is a partition such that every part is as much as possible a good model (an "algorithmic sufficient statistic") for the data in that part. Since this can be done for every…
In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].