Algorithmic complexity: Difference between revisions

Browse history interactively

← Previous edit Next edit →

Content deleted Content added

VisualWikitext

Inline

Revision as of 17:03, 4 December 2020

Algorithmic complexity may refer to:

In algorithmic information theory, the complexity of a particular string in terms of all algorithms that generate it.
- Solomonoff-Kolmogorov–Chaitin complexity, the most widely used such measure.
In Computational complexity theory, although it would be a non-formal usage of term, the time/space complexity of a particular problem in terms of all algorithms that solve it with computational resources (i.e., time or space) bounded by a function of the input's size.
- Or it may refer to the time/space complexity of a particular algorithm with respect to solving a particular problem (as above), which is a notion commonly found in analysis of algorithms.

This disambiguation page lists articles associated with the title Algorithmic complexity.
If an internal link led you here, you may wish to change the link to point directly to the intended article.

@@ Line 1: / Line 1: @@
 '''Algorithmic complexity''' may refer to:
-* In [[algorithmic information theory]], the complexity of a particular string, in terms of all algorithms that generate it.
+* In [[algorithmic information theory]], the complexity of a particular string in terms of all algorithms that generate it.
 ** [[Kolmogorov complexity|Solomonoff-Kolmogorov–Chaitin complexity]], the most widely used such measure.
-* In [[Computational complexity theory]], although it would be a non-formal usage of term, the time/space complexity of a particular problem, in terms of all algorithms that solve it with computational resources (i.e., time or space) bounded by a function of the input's size.
+* In [[Computational complexity theory]], although it would be a non-formal usage of term, the time/space complexity of a particular problem in terms of all algorithms that solve it with computational resources (i.e., time or space) bounded by a function of the input's size.
 ** Or it may refer to the time/space complexity of a particular algorithm with respect to solving a particular problem (as above), which is a notion commonly found in [[analysis of algorithms]].