Kolmogorov complexity and computably enumerable sets

Annals of Pure and Applied Logic 2013 / 12 Vol. 164; Iss. 12

Kolmogorov complexity and computably enumerable sets

Barmpalias, George, Li, Angsheng
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
164
Language:
english
Journal:
Annals of Pure and Applied Logic
DOI:
10.1016/j.apal.2013.06.007
Date:
December, 2013
File:
PDF, 356 KB
english, 2013
Conversion to is in progress
Conversion to is failed