External Links

    Journal: Theory Comput. Syst.

    Volume 58, Issue 3

    381 -- 382Noam Greenberg. Editorial: Special Issue on Computability, Complexity and Randomness
    383 -- 391Svetlana N. Selezneva, Anton V. Bukhman. Polynomial-Time Algorithms for Checking Some Properties of Boolean Functions Given by Polynomials
    392 -- 402Satyadev Nandakumar, Santhosh Kumar Vangapelli. Normality and Finite-State Dimension of Liouville Numbers
    403 -- 423Vladimir V. V'yugin. On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness
    424 -- 440Mikhail Andreev, Akim Kumok. The Sum 2 KM(x)-K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite
    441 -- 462Kenshi Miyabe. Reducibilities Relating to Schnorr Randomness
    463 -- 481Nikolay K. Vereshchagin. Algorithmic Minimal Sufficient Statistics: a New Approach
    482 -- 501Bruno Bauwens. Relating and Contrasting Plain and Prefix Kolmogorov Complexity
    runs on