Volume 56, Issue 3 | Theory of Computing Systems

Search all Theory of Computing Systems articles

Volume 56, Issue 3

April 2015

Special Issue on Computability, Complexity and Randomness

Issue Editors:

ELVIRA MAYORDOMO,
Wolfgang Merkle

8 articles in this issue

Editorial
Elvira Mayordomo
Wolfgang Merkle
EditorialNotes 14 March 2015 Pages: 437 - 438
Feasible Analysis, Randomness, and Base Invariance
Santiago Figueira
André Nies
OriginalPaper 03 October 2013 Pages: 439 - 464
Schnorr Triviality and Its Equivalent Notions
Kenshi Miyabe
OriginalPaper 29 September 2013 Pages: 465 - 486
Trivial Measures are not so Trivial
Christopher P. Porter
OriginalPaper 11 March 2015 Pages: 487 - 512
Topological Arguments for Kolmogorov Complexity
Andrei Romashchenko
Alexander Shen
OriginalPaper 13 February 2015 Pages: 513 - 526
Symbolic Dynamics: Entropy = Dimension = Complexity
Stephen G. Simpson
OriginalPaper 01 May 2014 Pages: 527 - 543
Cryptography and Algorithmic Randomness
Kohtaro Tadaki
Norihisa Doi
OriginalPaper 23 May 2014 Pages: 544 - 580
On Optimal Language Compression for Sets in PSPACE/poly
N. V. Vinodchandran
Marius Zimand
OriginalPaper 11 March 2014 Pages: 581 - 590