On computable enumerations. II (Q2264760): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A stronger form of a theorem of Friedberg / rank | |||
Normal rank | |||
Latest revision as of 12:46, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computable enumerations. II |
scientific article |
Statements
On computable enumerations. II (English)
0 references
1970
0 references
