{"title":"The complexity and entropy of Turing machines","authors":"P. Dufort, C. Lumsden","doi":"10.1109/PHYCMP.1994.363677","DOIUrl":null,"url":null,"abstract":"Addresses the relationship between dynamical systems theory and theoretical computer science, in particular the dynamical, information-theoretic and computational properties of systems that compute. These properties have been studied in cellular automata and the symbolic dynamics of maps over the unit interval, but have never been addressed in compact systems known to be capable of universal computation. Recent work is described in which the entropy, periodicity and regular language complexity of a large number of randomly generated Turing machines were calculated. The results are discussed in detail and compared with an identical analysis of a universal Turing machine. This comparison yields the first direct quantitative evidence that universal computation lies between ordered and chaotic behavior. The discussion concludes with a list of questions remaining to be answered about the phase-space portrait of computationally complex systems.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Workshop on Physics and Computation. PhysComp '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHYCMP.1994.363677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Addresses the relationship between dynamical systems theory and theoretical computer science, in particular the dynamical, information-theoretic and computational properties of systems that compute. These properties have been studied in cellular automata and the symbolic dynamics of maps over the unit interval, but have never been addressed in compact systems known to be capable of universal computation. Recent work is described in which the entropy, periodicity and regular language complexity of a large number of randomly generated Turing machines were calculated. The results are discussed in detail and compared with an identical analysis of a universal Turing machine. This comparison yields the first direct quantitative evidence that universal computation lies between ordered and chaotic behavior. The discussion concludes with a list of questions remaining to be answered about the phase-space portrait of computationally complex systems.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
