Algorithmic complexity - Revision history

ClueBot NG: Reverting possible vandalism by 106.51.74.137 to version by Crashed greek. Report False Positive? Thanks, ClueBot NG. (4292152) (Bot)

2023-12-26T09:10:34Z

Reverting possible vandalism by 106.51.74.137 to version by Crashed greek. Report False Positive? Thanks, ClueBot NG. (4292152) (Bot)

← Previous revision		Revision as of 09:10, 26 December 2023
Line 4:		Line 4:
	* In [[computational complexity theory]], although it would be a non-formal usage of the 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 the 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]].		** 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]].
	**[[Time complexity]] is the amount of computer time it takes to run an algorithm. ~~hello~~		**[[Time complexity]] is the amount of computer time it takes to run an algorithm.

	{{disambiguation}}		{{disambiguation}}

106.51.74.137 at 09:10, 26 December 2023

2023-12-26T09:10:32Z

← Previous revision		Revision as of 09:10, 26 December 2023
Line 4:		Line 4:
	* In [[computational complexity theory]], although it would be a non-formal usage of the 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 the 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]].		** 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]].
	**[[Time complexity]] is the amount of computer time it takes to run an algorithm.		**[[Time complexity]] is the amount of computer time it takes to run an algorithm. hello

	{{disambiguation}}		{{disambiguation}}

Crashed greek: add

2022-09-07T11:48:06Z

add

← Previous revision		Revision as of 11:48, 7 September 2022
Line 4:		Line 4:
	* In [[computational complexity theory]], although it would be a non-formal usage of the 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 the 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]].		** 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]].
			**[[Time complexity]] is the amount of computer time it takes to run an algorithm.

	{{disambiguation}}		{{disambiguation}}

2A02:1812:110C:DC00:4993:8F90:AD74:25E2 at 10:47, 14 June 2021

2021-06-14T10:47:10Z

← Previous revision		Revision as of 10:47, 14 June 2021
Line 1:		Line 1:
	'''Algorithmic complexity''' may refer to:		'''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.		** [[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 the 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 the 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]].		** 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]].

9FW: Remove needless capitalisation

2020-12-04T17:11:00Z

Remove needless capitalisation

← Previous revision		Revision as of 17:11, 4 December 2020
Line 2:		Line 2:
	* 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.		** [[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 the 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 the 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]].		** 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]].

9FW: Fix grammar

2020-12-04T17:07:11Z

Fix grammar

← Previous revision		Revision as of 17:07, 4 December 2020
Line 2:		Line 2:
	* 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.		** [[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 the 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]].		** 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]].

9FW: Remove superfluous commas

2020-12-04T17:03:00Z

Remove superfluous commas

← Previous revision		Revision as of 17:03, 4 December 2020
Line 1:		Line 1:
	'''Algorithmic complexity''' may refer to:		'''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.		** [[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]].		** 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]].

Donna Turner at 14:21, 17 July 2019

2019-07-17T14:21:39Z

← Previous revision		Revision as of 14:21, 17 July 2019
Line 1:		Line 1:
	'''Algorithmic complexity''' may refer to:		'''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–Chaitin complexity]], the most widely used such measure		** [[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 [[analysis of algorithms]], the complexity of a particular algorithm
	* In ~~[[computational~~ ~~complexity~~ ~~theory]],~~ the complexity of a particular problem, in ~~terms~~ of ~~all~~ ~~algorithms~~ ~~that~~ ~~solve~~ it		** 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]].

	{{disambiguation}}		{{disambiguation}}

Vmavanti: Cleanup per WP:MOSDAB using Dabfix

2018-03-06T01:20:33Z

Cleanup per WP:MOSDAB using Dabfix

← Previous revision		Revision as of 01:20, 6 March 2018
Line 1:		Line 1:
	'''Algorithmic complexity''' may refer to:		'''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–Chaitin complexity]], the most widely used such measure.		** [[Kolmogorov–Chaitin complexity]], the most widely used such measure
	* In [[analysis of algorithms]], the complexity of a particular algorithm.		* In [[analysis of algorithms]], the complexity of a particular algorithm
	* In [[computational complexity theory]], the complexity of a particular problem, in terms of all algorithms that solve it.		* In [[computational complexity theory]], the complexity of a particular problem, in terms of all algorithms that solve it

	{{disambiguation}}		{{disambiguation}}

I dream of horses: /* top */clean up, typos fixed: widely- → widely using AWB

2016-06-27T11:24:13Z

top: clean up, typos fixed: widely- → widely using AWB

← Previous revision		Revision as of 11:24, 27 June 2016
Line 1:		Line 1:
	'''Algorithmic complexity''' may refer to:		'''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–Chaitin complexity]], the most widely-used such measure.		** [[Kolmogorov–Chaitin complexity]], the most widely used such measure.
	* In [[analysis of algorithms]], the complexity of a particular algorithm.		* In [[analysis of algorithms]], the complexity of a particular algorithm.
	* In [[computational complexity theory]], the complexity of a particular problem, in terms of all algorithms that solve it.		* In [[computational complexity theory]], the complexity of a particular problem, in terms of all algorithms that solve it.

	{{~~disambig~~}}		{{disambiguation}}