Martin's game: a lower bound for the number of sets.

DOI10.1016/S0304-3975(01)00388-7zbMath1061.68079MaRDI QIDQ1853566

M. Ageev

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexity of an r.e. setMartin game

Mathematics Subject Classification ID

Games involving topology, set theory, or logic (91A44) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Kolmogorov complexity of enumerating finite sets

Cites Work

• Unnamed Item
• Borel determinacy

This page was built for publication: Martin's game: a lower bound for the number of sets.