Academic Journal
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
| العنوان: | Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility |
|---|---|
| المؤلفون: | Hector Zenil, Fernando Soler-Toscano, Jean-Paul Delahaye, Nicolas Gauvrit |
| المصدر: | PeerJ Computer Science, Vol 1, p e23 (2015) |
| بيانات النشر: | PeerJ Inc., 2015. |
| سنة النشر: | 2015 |
| المجموعة: | LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | Algorithmic complexity, Algorithmic probability, Kolmogorov–Chaitin complexity, Algorithmic information theory, Cellular automata, Solomonoff–Levin universal distribution, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex n-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequency of occurrence of a pattern with its algorithmic complexity, hence effectively providing estimations to the complexity of the generated patterns. Experiments to validate estimations of algorithmic complexity based on these concepts are presented, showing that the measure is stable in the face of some changes in computational formalism and that results are in agreement with the results obtained using lossless compression algorithms when both methods overlap in their range of applicability. We then use the output frequency of the set of 2-dimensional Turing machines to classify the algorithmic complexity of the space-time evolutions of Elementary Cellular Automata. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 2376-5992 |
| Relation: | https://peerj.com/articles/cs-23.pdf; https://peerj.com/articles/cs-23/; https://doaj.org/toc/2376-5992 |
| DOI: | 10.7717/peerj-cs.23 |
| URL الوصول: | https://doaj.org/article/9d1ad586ff294862af31a3a5b89de0a7 |
| رقم الانضمام: | edsdoj.9d1ad586ff294862af31a3a5b89de0a7 |
| قاعدة البيانات: | Directory of Open Access Journals |
| ResultId |
1 |
|---|---|
| Header |
edsdoj Directory of Open Access Journals edsdoj.9d1ad586ff294862af31a3a5b89de0a7 862 3 Academic Journal academicJournal 862.253845214844 |
| PLink |
https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsdoj&AN=edsdoj.9d1ad586ff294862af31a3a5b89de0a7&custid=s6537998&authtype=sso |
| FullText |
Array
(
[Availability] => 0
)
Array ( [0] => Array ( [Url] => https://doaj.org/article/9d1ad586ff294862af31a3a5b89de0a7 [Name] => EDS - DOAJ [Category] => fullText [Text] => View record in DOAJ [MouseOverText] => View record in DOAJ ) ) |
| Items |
Array
(
[Name] => Title
[Label] => Title
[Group] => Ti
[Data] => Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
)
Array ( [Name] => Author [Label] => Authors [Group] => Au [Data] => <searchLink fieldCode="AR" term="%22Hector+Zenil%22">Hector Zenil</searchLink><br /><searchLink fieldCode="AR" term="%22Fernando+Soler-Toscano%22">Fernando Soler-Toscano</searchLink><br /><searchLink fieldCode="AR" term="%22Jean-Paul+Delahaye%22">Jean-Paul Delahaye</searchLink><br /><searchLink fieldCode="AR" term="%22Nicolas+Gauvrit%22">Nicolas Gauvrit</searchLink> ) Array ( [Name] => TitleSource [Label] => Source [Group] => Src [Data] => PeerJ Computer Science, Vol 1, p e23 (2015) ) Array ( [Name] => Publisher [Label] => Publisher Information [Group] => PubInfo [Data] => PeerJ Inc., 2015. ) Array ( [Name] => DatePubCY [Label] => Publication Year [Group] => Date [Data] => 2015 ) Array ( [Name] => Subset [Label] => Collection [Group] => HoldingsInfo [Data] => LCC:Electronic computers. Computer science ) Array ( [Name] => Subject [Label] => Subject Terms [Group] => Su [Data] => <searchLink fieldCode="DE" term="%22Algorithmic+complexity%22">Algorithmic complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithmic+probability%22">Algorithmic probability</searchLink><br /><searchLink fieldCode="DE" term="%22Kolmogorov–Chaitin+complexity%22">Kolmogorov–Chaitin complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithmic+information+theory%22">Algorithmic information theory</searchLink><br /><searchLink fieldCode="DE" term="%22Cellular+automata%22">Cellular automata</searchLink><br /><searchLink fieldCode="DE" term="%22Solomonoff–Levin+universal+distribution%22">Solomonoff–Levin universal distribution</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+computers%2E+Computer+science%22">Electronic computers. Computer science</searchLink><br /><searchLink fieldCode="DE" term="%22QA75%2E5-76%2E95%22">QA75.5-76.95</searchLink> ) Array ( [Name] => Abstract [Label] => Description [Group] => Ab [Data] => We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex n-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequency of occurrence of a pattern with its algorithmic complexity, hence effectively providing estimations to the complexity of the generated patterns. Experiments to validate estimations of algorithmic complexity based on these concepts are presented, showing that the measure is stable in the face of some changes in computational formalism and that results are in agreement with the results obtained using lossless compression algorithms when both methods overlap in their range of applicability. We then use the output frequency of the set of 2-dimensional Turing machines to classify the algorithmic complexity of the space-time evolutions of Elementary Cellular Automata. ) Array ( [Name] => TypeDocument [Label] => Document Type [Group] => TypDoc [Data] => article ) Array ( [Name] => Format [Label] => File Description [Group] => SrcInfo [Data] => electronic resource ) Array ( [Name] => Language [Label] => Language [Group] => Lang [Data] => English ) Array ( [Name] => ISSN [Label] => ISSN [Group] => ISSN [Data] => 2376-5992 ) Array ( [Name] => NoteTitleSource [Label] => Relation [Group] => SrcInfo [Data] => https://peerj.com/articles/cs-23.pdf; https://peerj.com/articles/cs-23/; https://doaj.org/toc/2376-5992 ) Array ( [Name] => DOI [Label] => DOI [Group] => ID [Data] => 10.7717/peerj-cs.23 ) Array ( [Name] => URL [Label] => Access URL [Group] => URL [Data] => <link linkTarget="URL" linkTerm="https://doaj.org/article/9d1ad586ff294862af31a3a5b89de0a7" linkWindow="_blank">https://doaj.org/article/9d1ad586ff294862af31a3a5b89de0a7</link> ) Array ( [Name] => AN [Label] => Accession Number [Group] => ID [Data] => edsdoj.9d1ad586ff294862af31a3a5b89de0a7 ) |
| RecordInfo |
Array
(
[BibEntity] => Array
(
[Identifiers] => Array
(
[0] => Array
(
[Type] => doi
[Value] => 10.7717/peerj-cs.23
)
)
[Languages] => Array
(
[0] => Array
(
[Text] => English
)
)
[PhysicalDescription] => Array
(
[Pagination] => Array
(
[StartPage] => e23
)
)
[Subjects] => Array
(
[0] => Array
(
[SubjectFull] => Algorithmic complexity
[Type] => general
)
[1] => Array
(
[SubjectFull] => Algorithmic probability
[Type] => general
)
[2] => Array
(
[SubjectFull] => Kolmogorov–Chaitin complexity
[Type] => general
)
[3] => Array
(
[SubjectFull] => Algorithmic information theory
[Type] => general
)
[4] => Array
(
[SubjectFull] => Cellular automata
[Type] => general
)
[5] => Array
(
[SubjectFull] => Solomonoff–Levin universal distribution
[Type] => general
)
[6] => Array
(
[SubjectFull] => Electronic computers. Computer science
[Type] => general
)
[7] => Array
(
[SubjectFull] => QA75.5-76.95
[Type] => general
)
)
[Titles] => Array
(
[0] => Array
(
[TitleFull] => Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
[Type] => main
)
)
)
[BibRelationships] => Array
(
[HasContributorRelationships] => Array
(
[0] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Hector Zenil
)
)
)
[1] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Fernando Soler-Toscano
)
)
)
[2] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Jean-Paul Delahaye
)
)
)
[3] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Nicolas Gauvrit
)
)
)
)
[IsPartOfRelationships] => Array
(
[0] => Array
(
[BibEntity] => Array
(
[Dates] => Array
(
[0] => Array
(
[D] => 01
[M] => 09
[Type] => published
[Y] => 2015
)
)
[Identifiers] => Array
(
[0] => Array
(
[Type] => issn-print
[Value] => 23765992
)
)
[Numbering] => Array
(
[0] => Array
(
[Type] => volume
[Value] => 1
)
)
[Titles] => Array
(
[0] => Array
(
[TitleFull] => PeerJ Computer Science
[Type] => main
)
)
)
)
)
)
)
|
| IllustrationInfo |