New Computational Paradigms
From MaRDI portal
Publication:5717027
DOI10.1007/b136981zbMath1113.03331MaRDI QIDQ5717027
Rodney G. Downey, Wolfgang Merkle, Jan Reimann
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136981
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D80: Applications of computability and recursion theory
03D25: Recursively (computably) enumerable sets and degrees
Related Items
Kolmogorov-Loveland stochasticity and Kolmogorov complexity, Unified characterizations of lowness properties via Kolmogorov complexity