Information-theoretic characterizations of recursive infinite strings (Q1226484): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1016/0304-3975(76)90005-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997686864 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information-Theoretic Incompleteness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A variant of the Kolmogorov concept of complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Process complexity and effective random tests / rank | |||
Normal rank | |||
Latest revision as of 18:49, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Information-theoretic characterizations of recursive infinite strings |
scientific article |
Statements
Information-theoretic characterizations of recursive infinite strings (English)
0 references
1976
0 references
