{"title":"Expected Algorithmic Specified Complexity","authors":"David Nemati, Eric M. Holloway","doi":"10.5048/bio-c.2019.2","DOIUrl":null,"url":null,"abstract":"Algorithmic specified complexity (ASC) is an information metric that measures meaning in an event, based on a chance hypothesis and a context. We prove expectation of ASC with regard to the chance hypothesis is always negative, and empirically apply our finding. We then use this result to prove expected ASC is conserved under stochastic processing, and that complexity for individual events is conserved under deterministic and stochastic processing.","PeriodicalId":89660,"journal":{"name":"BIO-complexity","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BIO-complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5048/bio-c.2019.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Algorithmic specified complexity (ASC) is an information metric that measures meaning in an event, based on a chance hypothesis and a context. We prove expectation of ASC with regard to the chance hypothesis is always negative, and empirically apply our finding. We then use this result to prove expected ASC is conserved under stochastic processing, and that complexity for individual events is conserved under deterministic and stochastic processing.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
