Automatic Complexity : : A Computable Measure of Irregularity / / Bjørn Kjos-Hanssen.
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 fee...
Saved in:
| VerfasserIn: | |
|---|---|
| Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2024] 2024 |
| Year of Publication: | 2024 |
| Language: | English |
| Series: | De Gruyter Series in Logic and Its Applications ,
12 |
| Online Access: | |
| Physical Description: | 1 online resource (XII, 144 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 03074nam a22006615i 4500 | ||
|---|---|---|---|
| 001 | 9783110774870 | ||
| 003 | DE-B1597 | ||
| 005 | 20240207110643.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 240207t20242024gw fo d z eng d | ||
| 020 | |a 9783110774870 | ||
| 024 | 7 | |a 10.1515/9783110774870 |2 doi | |
| 035 | |a (DE-B1597)612758 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 100 | 1 | |a Kjos-Hanssen, Bjørn, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Automatic Complexity : |b A Computable Measure of Irregularity / |c Bjørn Kjos-Hanssen. |
| 264 | 1 | |a Berlin ; |a Boston : |b De Gruyter, |c [2024] | |
| 264 | 4 | |c 2024 | |
| 300 | |a 1 online resource (XII, 144 p.) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 0 | |a De Gruyter Series in Logic and Its Applications , |x 1438-1893 ; |v 12 | |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |a 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 registers. | ||
| 520 | |a 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. | ||
| 530 | |a Issued also in print. | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 07. Feb 2024) | |
| 650 | 4 | |a Automaten. | |
| 650 | 4 | |a Komplexität. | |
| 650 | 4 | |a Turingtheorie. | |
| 650 | 4 | |a formale Sprachen. | |
| 653 | |a Complexity, Kolmogorov structures, random words, normal words, Fibonacci words. | ||
| 776 | 0 | |c EPUB |z 9783110774900 | |
| 776 | 0 | |c print |z 9783110774818 | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9783110774870 |
| 856 | 4 | 0 | |u https://www.degruyter.com/isbn/9783110774870 |
| 856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/document/cover/isbn/9783110774870/original |
| 912 | |a EBA_CL_CHCOMSGSEN | ||
| 912 | |a EBA_CL_MTPY | ||
| 912 | |a EBA_DGALL | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_CHCOMSGSEN | ||
| 912 | |a EBA_ECL_MTPY | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||