首页 | 本学科首页   官方微博 | 高级检索  
     


Strict process machine complexity
Authors:Ferit Toska
Affiliation:1. Department of Mathematics, University of Florida, P.O. Box 118105, Gainesville, FL, 32611, USA
Abstract:We introduce a notion of description for infinite sequences and their sets, and a corresponding notion of complexity. We show that for strict process machines, complexity of a sequence or of a subset of Cantor space is equal to its effective Hausdorff dimension.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号