Volume 62, Issue 7 | Theory of Computing Systems

Search all Theory of Computing Systems articles

Volume 62, Issue 7

October 2018

Computability, Complexity, and Randomness

Issue Editors:

Rod Downey,
Denis R. Hirschfeldt,
Bjoern Kjos-Hanssen

7 articles in this issue

Preface
Rod Downey
Denis Hirschfeldt
Bjørn Kjos-Hanssen
EditorialNotes 10 February 2018 Pages: 1553 - 1554
Finite-State Independence
Verónica Becher
Olivier Carton
Pablo Ariel Heiber
OriginalPaper 11 November 2017 Pages: 1555 - 1572
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers
Cristian S. Calude
Ludwig Staiger
OriginalPaper 27 April 2017 Pages: 1573 - 1585
Bounded Turing Reductions and Data Processing Inequalities for Sequences
Adam Case
OriginalPaper 31 August 2017 Pages: 1586 - 1598
Coherence of Reducibilities with Randomness Notions
Kenshi Miyabe
OriginalPaper 09 March 2017 Pages: 1599 - 1619
Effective Hausdorff Dimension in General Metric Spaces
Elvira Mayordomo
OriginalPaper 07 February 2018 Pages: 1620 - 1636
The Random Members of a \({\Pi }_{1}^{0}\) Class
Douglas Cenzer
Christopher P. Porter
OriginalPaper 25 November 2017 Pages: 1637 - 1671