We a good story
Quick delivery in the UK

Kolmogorov Complexity and Computational Complexity

About Kolmogorov Complexity and Computational Complexity

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.

Show more
  • Language:
  • English
  • ISBN:
  • 9783642777370
  • Binding:
  • Paperback
  • Pages:
  • 105
  • Published:
  • December 21, 2011
  • Edition:
  • 11992
  • Dimensions:
  • 155x235x6 mm.
  • Weight:
  • 196 g.
Delivery: 1-2 weeks
Expected delivery: October 18, 2024

Description of Kolmogorov Complexity and Computational Complexity

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.

User ratings of Kolmogorov Complexity and Computational Complexity



Find similar books
The book Kolmogorov Complexity and Computational Complexity can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.