Automatic Complexity (eBook, ePUB)

A Computable Measure of Irregularity

Versandkostenfrei!

Sofort per Download lieferbar

122,95 €

inkl. MwSt.

Jetzt bewerten

Alle Infos zum eBook verschenken

Weitere Ausgaben:

Gebundenes Buch eBook, PDF

PAYBACK Punkte

61 °P sammeln!

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.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.