Volume 58, Issue 3

April 2016

Special Issue on Computability, Complexity and Randomness

Issue Editor:

8 articles in this issue

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

Search