Custom cover image
Custom cover image

Automatic complexity : a computable measure of irregularity / Bjørn Kjos-Hanssen

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: De Gruyter series in logic and its applications ; volume 12Publisher: Berlin ; Boston : De Gruyter, [2024]Copyright date: © 2024Description: 1 Online-Ressource (XII, 142 Seiten)ISBN:
  • 9783110774870
  • 9783110774900
Subject(s): Additional physical formats: 9783110774818 | Erscheint auch als: Automatic complexity. Druck-Ausgabe Berlin : De Gruyter, 2024. XII, 142 SeitenRVK: RVK: ST 136DOI: DOI: 10.1515/9783110774870Online resources: Additional physical formats: Issued also in printSummary: Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. The complexities of many types of words are studied, including random words, normal words, Fibonacci words, Thue words, and words produced by linear feedback shift registersSummary: 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 problemsPPN: PPN: 1881003655Package identifier: Produktsigel: ZDB-23-DMA | EBA-CL-CHCOMSGSEN | EBA-CL-MTPY | EBA-DGALL | EBA-EBKALL | EBA-ECL-CHCOMSGSEN | EBA-ECL-MTPY | EBA-EEBKALL | EBA-ESTMALL | EBA-STMALL | GBV-deGruyter-alles
No physical items for this record

Restricted Access; Controlled Vocabulary for Access Rights: online access with authorization coarar

http://purl.org/coar/access_right/c_16ec.

Issued also in print

Issued also in print

In English