Minimal Programs Are Almost Optimal

Calude, C.S; Ishihara, H; Yamaguchi, T

dc.contributor.author	Calude, C.S	en
dc.contributor.author	Ishihara, H	en
dc.contributor.author	Yamaguchi, T	en
dc.date.accessioned	2009-04-16T23:13:52Z	en
dc.date.available	2009-04-16T23:13:52Z	en
dc.date.issued	1999-11	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-116 (1999)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3625	en
dc.description.abstract	According to the Algorithmic Coding Theorem, minimal programs of any universal machine are prefix-codes asymptotically optimal with respect to the machine algorithmic probabilities. A stronger version of this result will be proven for a class of machines, not necessarily universal, and any semi-distribution. Furthermore, minimal programs with respect to universal machines will be shown to be almost optimal for any semicomputable semi-distribution. Finally, a complete characterization of all machines satisfying the Algorithmic Coding Theorem is given.	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	Minimal Programs Are Almost Optimal	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