A Machine-Independent Theory of the Complexity of Recursive Functions (Q5537605): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55918695 / rank | |||
Normal rank | |||
| 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.1145/321386.321395 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089442854 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:20, 19 March 2024
scientific article; zbMATH DE number 3248800
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Machine-Independent Theory of the Complexity of Recursive Functions |
scientific article; zbMATH DE number 3248800 |
Statements
A Machine-Independent Theory of the Complexity of Recursive Functions (English)
0 references
1967
0 references
mathematical logic
0 references
complexity
0 references
recursive functions
0 references
