Kolmogorov Complexity and Computational Complexity

Available
0
StarStarStarStarStar
0Reviews
Unknown authorUnknown author
The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of "complexity": Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compua...
Read more
E-book
pdf
Price
89.50 £
The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of "complexity": Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compua...
Read more

Options

  • Formats: pdf
  • ISBN: 9783642777356
  • Publication Date: 6 Dec 2012
  • Publisher: Springer Berlin Heidelberg
  • Product language: English
  • Drm Setting: DRM