Kolmogorov entropy in the context of computability theory

Recursively enumerable sets of positive integers and their decision problems

Emil L. Post · Bulletin of the American Mathematical Society · 1944 · 890 citations · Full text

Humanities, Computer Science, Mathematics +13

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

R. Friedberg · Journal of Symbolic Logic · 1958 · 244 citations

Natural Sciences, Computer Science, Mathematics +12

Relations between varieties of kolmogorov complexities

Vladimir Uspensky, Alexander Shen · Theory of Computing Systems · 1996 · 73 citations

Natural Sciences, Computer Science, Mathematics +11

On complexity properties of recursively enumerable sets

Manuel Blum, Isabela G. Marques · Journal of Symbolic Logic · 1973 · 65 citations

Computing, Computer Science, Mathematics +13

A note on universal sets

A. H. Lachlan · Journal of Symbolic Logic · 1966 · 32 citations

Natural Sciences, Mathematics, Logic +9