Traceable Sets

DOI10.1007/978-3-642-15240-5_22zbMath1198.68155OpenAlexW4236049186MaRDI QIDQ3163891

Rupert Hölzl, Wolfgang Merkle

Publication date: 27 October 2010

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15240-5_22

zbMATH Keywords

traceability

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (6)

Reducibilities relating to Schnorr randomness ⋮ DEEP CLASSES ⋮ On effectively closed sets of effective strong measure zero ⋮ Randomness for computable measures and initial segment complexity ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Schnorr triviality and its equivalent notions

This page was built for publication: Traceable Sets