On computable enumerations. I (Q2264759): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5619076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Creative Functions / 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: STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the indexing of classes of recursively enumerable sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Godel Numberings Versus Friedberg Numberings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degrees of Computability / rank | |||
Normal rank |
Revision as of 13:46, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On computable enumerations. I |
scientific article |
Statements
On computable enumerations. I (English)
0 references
1969
0 references
0 references