Comparison between the complexity of a function and the complexity of its graph (Q5958280): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4326782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Descriptive complexity of computable sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4337021 / 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: Relations between varieties of kolmogorov complexities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank | |||
Normal rank | |||
Revision as of 22:21, 3 June 2024
scientific article; zbMATH DE number 1715281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison between the complexity of a function and the complexity of its graph |
scientific article; zbMATH DE number 1715281 |
Statements
Comparison between the complexity of a function and the complexity of its graph (English)
0 references
3 March 2002
0 references
Kolmogorov complexity
0 references
recursive infinite sequences
0 references
data flow complexity
0 references
recursive function
0 references
