On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers (Q5579042): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: DBLP publication ID (P1635): journals/jacm/Chaitin69a, #quickstatements; #temporary_batch_1731468600454 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321526.321530 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977165845 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/Chaitin69a / rank | |||
Normal rank | |||
Latest revision as of 05:29, 13 November 2024
scientific article; zbMATH DE number 3298855
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers |
scientific article; zbMATH DE number 3298855 |
Statements
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers (English)
0 references
1969
0 references
languages, automata, networks
0 references
