The Kolmogorov Complexity of Liouville Numbers

Show simple item record

dc.contributor.author Staiger, L en
dc.date.accessioned 2009-04-16T23:18:07Z en
dc.date.available 2009-04-16T23:18:07Z en
dc.date.issued 1999-03 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-096 (1999) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri http://hdl.handle.net/2292/3605 en
dc.description.abstract We consider for a real number a the Kolmogorov complexities of its expansions with respect to different bases. In the paper it is shown that, for usual and self-delimiting Kolmogorov complexity, the complexity of the prefixes of their expansions with respect to different bases r and b are related in a way which depends only on the relative information of one base with respect to the other. More precisely, we show that the complexity of the length . logr b prefix of the base r expansion of α is the same (up to an additive constant) as the logr b-fold complexity of the length l prefix of the base b expansion of α. Then we use this fact to derive complexity theoretic proofs for the base independence of the randomness of real numbers and for some properties of Liouville numbers. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial en
dc.title The Kolmogorov Complexity of Liouville Numbers en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics