Skip to Main content Skip to Navigation
Conference papers

Plain stopping time and conditional complexities revisited

Abstract : In this paper we analyze the notion of “stopping time complexity”, the amount of information needed to specify when to stop while reading an infinite sequence. This notion was introduced by Vovk and Pavlovic [9]. It turns out that plain stopping time complexity of a binary string x could be equivalently defined as (a) the minimal plain complexity of a Turing machine that stops after reading x on a one-directional input tape; (b) the minimal plain complexity of an algorithm that enumerates a prefix-free set containing x; (c) the conditional complexity C(x|x∗) where x in the condition is understood as a prefix of an infinite binary sequence while the first x is understood as a terminated binary string; (d) as a minimal upper semicomputable function K such that each binary sequence has at most 2n prefixes z such that K(z) < n; (e) as max CX (x) where CX (z) is plain Kolmogorov complexity of z relative to oracle X and the maximum is taken over all extensions X of x. We also show that some of these equivalent definitions become non-equivalent in the more general setting where the condition y and the object x may differ, and answer an open question from Chernov, Hutter and Schmidhuber [3].
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Alexander Shen <>
Submitted on : Thursday, June 6, 2019 - 10:53:09 AM
Last modification on : Friday, May 21, 2021 - 8:22:02 PM


Distributed under a Creative Commons Attribution 4.0 International License




Mikhail Andreev, Gleb Posobin, Alexander Shen. Plain stopping time and conditional complexities revisited. MFCS: Mathematical Foundations of Computer Science, Aug 2018, Liverpool, United Kingdom. pp.2:1--2:12, ⟨10.4230/LIPIcs.MFCS.2018.2⟩. ⟨lirmm-01982373⟩



Record views


Files downloads