Automatic Complexity : : A Computable Measure of Irregularity /

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

Full description

Saved in:
Bibliographic Details
VerfasserIn:
Kjos-Hanssen, Bjørn,
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!
id 9783110774870
ctrlnum (DE-B1597)612758
collection bib_alma
record_format marc
spelling Kjos-Hanssen, Bjørn, author. aut http://id.loc.gov/vocabulary/relators/aut
Automatic Complexity : A Computable Measure of Irregularity / Bjørn Kjos-Hanssen.
Berlin ; Boston : De Gruyter, [2024]
2024
1 online resource (XII, 144 p.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
De Gruyter Series in Logic and Its Applications , 1438-1893 ; 12
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
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.
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.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 07. Feb 2024)
Automaten.
Komplexität.
Turingtheorie.
formale Sprachen.
Complexity, Kolmogorov structures, random words, normal words, Fibonacci words.
EPUB 9783110774900
print 9783110774818
https://doi.org/10.1515/9783110774870
https://www.degruyter.com/isbn/9783110774870
Cover https://www.degruyter.com/document/cover/isbn/9783110774870/original
language English
format eBook
author Kjos-Hanssen, Bjørn,
Kjos-Hanssen, Bjørn,
spellingShingle Kjos-Hanssen, Bjørn,
Kjos-Hanssen, Bjørn,
Automatic Complexity : A Computable Measure of Irregularity /
De Gruyter Series in Logic and Its Applications ,
author_facet Kjos-Hanssen, Bjørn,
Kjos-Hanssen, Bjørn,
author_variant b k h bkh
b k h bkh
author_role VerfasserIn
VerfasserIn
author_sort Kjos-Hanssen, Bjørn,
title Automatic Complexity : A Computable Measure of Irregularity /
title_sub A Computable Measure of Irregularity /
title_full Automatic Complexity : A Computable Measure of Irregularity / Bjørn Kjos-Hanssen.
title_fullStr Automatic Complexity : A Computable Measure of Irregularity / Bjørn Kjos-Hanssen.
title_full_unstemmed Automatic Complexity : A Computable Measure of Irregularity / Bjørn Kjos-Hanssen.
title_auth Automatic Complexity : A Computable Measure of Irregularity /
title_new Automatic Complexity :
title_sort automatic complexity : a computable measure of irregularity /
series De Gruyter Series in Logic and Its Applications ,
series2 De Gruyter Series in Logic and Its Applications ,
publisher De Gruyter,
publishDate 2024
physical 1 online resource (XII, 144 p.)
Issued also in print.
isbn 9783110774870
9783110774900
9783110774818
issn 1438-1893 ;
url https://doi.org/10.1515/9783110774870
https://www.degruyter.com/isbn/9783110774870
https://www.degruyter.com/document/cover/isbn/9783110774870/original
illustrated Not Illustrated
doi_str_mv 10.1515/9783110774870
work_keys_str_mv AT kjoshanssenbjørn automaticcomplexityacomputablemeasureofirregularity
status_str n
ids_txt_mv (DE-B1597)612758
carrierType_str_mv cr
is_hierarchy_title Automatic Complexity : A Computable Measure of Irregularity /
_version_ 1792281689431474176
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03074nam a22006615i 4500</leader><controlfield tag="001">9783110774870</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20240207110643.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">240207t20242024gw fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110774870</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110774870</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)612758</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kjos-Hanssen, Bjørn, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automatic Complexity :</subfield><subfield code="b">A Computable Measure of Irregularity /</subfield><subfield code="c">Bjørn Kjos-Hanssen.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ;</subfield><subfield code="a">Boston : </subfield><subfield code="b">De Gruyter, </subfield><subfield code="c">[2024]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">2024</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (XII, 144 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Series in Logic and Its Applications ,</subfield><subfield code="x">1438-1893 ;</subfield><subfield code="v">12</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 07. Feb 2024)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automaten.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Komplexität.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turingtheorie.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">formale Sprachen.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complexity, Kolmogorov structures, random words, normal words, Fibonacci words.</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">EPUB</subfield><subfield code="z">9783110774900</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110774818</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110774870</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110774870</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9783110774870/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>

Similar Items