On complexity properties of recursively enumerable sets (Q4101804): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/2271984 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975592766 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:25, 12 June 2024
scientific article; zbMATH DE number 3523528
Language | Label | Description | Also known as |
---|---|---|---|
English | On complexity properties of recursively enumerable sets |
scientific article; zbMATH DE number 3523528 |
Statements
On complexity properties of recursively enumerable sets (English)
0 references
1974
0 references