Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-2403-06629
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-2403-06629
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Felipe_S._Abrah%E2%88%9A%C2%A3o
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hector_Zenil
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jesper_Tegn%E2%88%9A%C2%A9r
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Narsis_A._Kiani
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Santiago_Hern%E2%88%9A%C2%B0ndez-Orozco
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.48550%2FarXiv.2403.06629
>
foaf:
homepage
<
https://doi.org/10.48550/arXiv.2403.06629
>
dc:
identifier
DBLP journals/corr/abs-2403-06629
(xsd:string)
dc:
identifier
DOI doi.org%2F10.48550%2FarXiv.2403.06629
(xsd:string)
dcterms:
issued
2024
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/corr
>
rdfs:
label
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Felipe_S._Abrah%E2%88%9A%C2%A3o
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hector_Zenil
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jesper_Tegn%E2%88%9A%C2%A9r
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Narsis_A._Kiani
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Santiago_Hern%E2%88%9A%C2%B0ndez-Orozco
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-2403-06629/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/abs-2403-06629
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/corr/corr2403.html#abs-2403-06629
>
rdfs:
seeAlso
<
https://doi.org/10.48550/arXiv.2403.06629
>
dc:
title
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
abs/2403.06629
(xsd:string)