Program size complexity for possibly infinite computations (Q558440): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/ndjfl/BecherFNP05, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ndjfl/BecherFNP05 / rank | |||
Normal rank | |||
Latest revision as of 14:55, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Program size complexity for possibly infinite computations |
scientific article |
Statements
Program size complexity for possibly infinite computations (English)
0 references
6 July 2005
0 references
Turing monotone machines
0 references
Kolmorogov complexity
0 references
