On the number of infinite sequences with trivial initial segment complexity期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On the number of infinite sequences with trivial initial segment complexity

Authors:	George Barmpalias T.F. Sterkenburg

Affiliation:	^a State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, P.O. Box 8718, China ^b Institute for Logic, Language and Computation, Universiteit van Amsterdam, P.O. Box 94242, 1090 GE Amsterdam, The Netherlands

Abstract:

Keywords:	Kolmogorov complexity mmlsi7" class=" mathmlsrc" onclick=" submitCitation('/science?_ob=MathURL& _method=retrieve& _eid=1-s2.0-S0304397511007961& _mathId=si7.gif& _pii=S0304397511007961& _issn=03043975& _acct=C000054348& _version=1& _userid=3837164& md5=8618c2d8552398f563e24ffe4c4bd4e1')" style=" cursor:pointer " alt=" Click to view the MathML source" title=" Click to view the MathML source" > formulatext" title=" click to view the MathML source" >K-trivial sets Arithmetical complexity Trees
本文献已被 ScienceDirect 等数据库收录！