On computable enumerations. I (Q2264759): Difference between revisions

@@ Property / author @@
-Yuri L. Ershov
@@ Property / author: Yuri L. Ershov / rank @@
-Normal rank
@@ Property / author @@
+Yuri L. Ershov
@@ Property / author: Yuri L. Ershov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5619076
@@ Property / cites work: Q5619076 / rank @@
+Normal rank
@@ Property / cites work @@
+Creative Functions
@@ Property / cites work: Creative Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
+Normal rank
@@ Property / cites work @@
+STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
@@ Property / cites work: STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+On the indexing of classes of recursively enumerable sets
+Normal rank
@@ Property / cites work @@
+Godel Numberings Versus Friedberg Numberings
@@ Property / cites work: Godel Numberings Versus Friedberg Numberings / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of Computability
@@ Property / cites work: Degrees of Computability / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02219286
+Normal rank
@@ Property / OpenAlex ID @@
+W4234042089
@@ Property / OpenAlex ID: W4234042089 / rank @@
+Normal rank