Udsalget slutter om
Udvidet returret til d. 31. januar 2025

Automatic Complexity - Bjørn Kjos-Hanssen - Bog

- A Computable Measure of Irregularity

Bag om Automatic Complexity

Automatic complexity is a computable and visual form of Kolmogorov complexity. Introduced by Shallit and Wang in 2001, it replaces Turing machines by finite automata, and has connections to normalized information distance, logical depth, and linear diophantine equations. Automatic Complexity is the first book on the subject and includes exercises with solutions written for the proof assistant Lean, computer programs to calculate automatic complexity, and many open problems.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783110774818
  • Indbinding:
  • Hardback
  • Udgivet:
  • 19. februar 2024
  • Størrelse:
  • 170x244x11 mm.
  • Vægt:
  • 454 g.
  • 8-11 hverdage.
  • 12. december 2024
På lager
Forlænget returret til d. 31. januar 2025

Normalpris

  • BLACK FRIDAY
    : :

Medlemspris

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

Beskrivelse af Automatic Complexity

Automatic complexity is a computable and visual form of Kolmogorov complexity. Introduced by Shallit and Wang in 2001, it replaces Turing machines by finite automata, and has connections to normalized information distance, logical depth, and linear diophantine equations. Automatic Complexity is the first book on the subject and includes exercises with solutions written for the proof assistant Lean, computer programs to calculate automatic complexity, and many open problems.

Brugerbedømmelser af Automatic Complexity



Find lignende bøger
Bogen Automatic 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.