The combinatorial equivalence of a computability theoretic question

From MaRDI portal

Publication:6356944

Jump to:navigation, search

arXiv2012.13588MaRDI QIDQ6356944

Publication date: 25 December 2020

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)

This page was built for publication: The combinatorial equivalence of a computability theoretic question

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6356944&oldid=35980593"