Udvidet returret til d. 31. januar 2025

Kolmogorov Complexity and Computational Complexity - Bog

Bag om 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783642777370
  • Indbinding:
  • Paperback
  • Sideantal:
  • 105
  • Udgivet:
  • 21. december 2011
  • Udgave:
  • 11992
  • Størrelse:
  • 155x235x6 mm.
  • Vægt:
  • 196 g.
  • 8-11 hverdage.
  • 28. november 2024
På lager

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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.

Brugerbedømmelser af Kolmogorov Complexity and Computational Complexity



Find lignende bøger
Bogen Kolmogorov Complexity and Computational Complexity findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.