Julia Esposito , Jyotika Kakar , Tasneem Khokhar , Tiana Noll-Walker , Fatima Omar , Anna Christen , H. James Cleaves II , McCullen Sandora
{"title":"比较书面和分子符号系统的复杂性。","authors":"Julia Esposito , Jyotika Kakar , Tasneem Khokhar , Tiana Noll-Walker , Fatima Omar , Anna Christen , H. James Cleaves II , McCullen Sandora","doi":"10.1016/j.biosystems.2024.105297","DOIUrl":null,"url":null,"abstract":"<div><p>Symbolic systems (SSs) are uniquely products of living systems, such that symbolism and life may be inextricably intertwined phenomena. Within a given SS, there is a range of symbol complexity over which signaling is functionally optimized. This range exists relative to a complex and potentially infinitely large background of latent, unused symbol space. Understanding how symbol sets sample this latent space is relevant to diverse fields including biochemistry and linguistics.</p><p>We quantitatively explored the graphic complexity of two biosemiotic systems: genetically encoded amino acids (GEAAs) and written language. Molecular and graphical notions of complexity are highly correlated for GEAAs and written language. Symbol sets are generally neither minimally nor maximally complex relative to their latent spaces, but exist across an objectively definable distribution, with the GEAAs having especially low complexity. The selection pressures guiding these disparate systems are explicable by symbol production and disambiguation efficiency. These selection pressures may be universal, offer a quantifiable metric for comparison, and suggest that all life in the Universe may discover optimal symbol set complexity distributions with respect to their latent spaces. If so, the “complexity” of individual components of SSs may not be as strong a biomarker as symbol set complexity distribution.</p></div>","PeriodicalId":2,"journal":{"name":"ACS Applied Bio Materials","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparing the complexity of written and molecular symbolic systems\",\"authors\":\"Julia Esposito , Jyotika Kakar , Tasneem Khokhar , Tiana Noll-Walker , Fatima Omar , Anna Christen , H. James Cleaves II , McCullen Sandora\",\"doi\":\"10.1016/j.biosystems.2024.105297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Symbolic systems (SSs) are uniquely products of living systems, such that symbolism and life may be inextricably intertwined phenomena. Within a given SS, there is a range of symbol complexity over which signaling is functionally optimized. This range exists relative to a complex and potentially infinitely large background of latent, unused symbol space. Understanding how symbol sets sample this latent space is relevant to diverse fields including biochemistry and linguistics.</p><p>We quantitatively explored the graphic complexity of two biosemiotic systems: genetically encoded amino acids (GEAAs) and written language. Molecular and graphical notions of complexity are highly correlated for GEAAs and written language. Symbol sets are generally neither minimally nor maximally complex relative to their latent spaces, but exist across an objectively definable distribution, with the GEAAs having especially low complexity. The selection pressures guiding these disparate systems are explicable by symbol production and disambiguation efficiency. These selection pressures may be universal, offer a quantifiable metric for comparison, and suggest that all life in the Universe may discover optimal symbol set complexity distributions with respect to their latent spaces. If so, the “complexity” of individual components of SSs may not be as strong a biomarker as symbol set complexity distribution.</p></div>\",\"PeriodicalId\":2,\"journal\":{\"name\":\"ACS Applied Bio Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2024-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Bio Materials\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0303264724001825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATERIALS SCIENCE, BIOMATERIALS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Bio Materials","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0303264724001825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, BIOMATERIALS","Score":null,"Total":0}
Comparing the complexity of written and molecular symbolic systems
Symbolic systems (SSs) are uniquely products of living systems, such that symbolism and life may be inextricably intertwined phenomena. Within a given SS, there is a range of symbol complexity over which signaling is functionally optimized. This range exists relative to a complex and potentially infinitely large background of latent, unused symbol space. Understanding how symbol sets sample this latent space is relevant to diverse fields including biochemistry and linguistics.
We quantitatively explored the graphic complexity of two biosemiotic systems: genetically encoded amino acids (GEAAs) and written language. Molecular and graphical notions of complexity are highly correlated for GEAAs and written language. Symbol sets are generally neither minimally nor maximally complex relative to their latent spaces, but exist across an objectively definable distribution, with the GEAAs having especially low complexity. The selection pressures guiding these disparate systems are explicable by symbol production and disambiguation efficiency. These selection pressures may be universal, offer a quantifiable metric for comparison, and suggest that all life in the Universe may discover optimal symbol set complexity distributions with respect to their latent spaces. If so, the “complexity” of individual components of SSs may not be as strong a biomarker as symbol set complexity distribution.