On Universal Computably Enumerable Prefix Codes

Calude, C.S; Staiger, L

dc.contributor.author	Calude, C.S	en
dc.contributor.author	Staiger, L	en
dc.date.accessioned	2009-04-16T23:11:00Z	en
dc.date.available	2009-04-16T23:11:00Z	en
dc.date.issued	2007-10	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-312 (2007)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3819	en
dc.description.abstract	We study computably enumerable (c.e.) prefix codes which are capable of coding all positive integers in an optimal way up to a fixed constant: these codes will be called universal. We prove various characterisations of these codes including the following one: a c.e. prefix code is universal iff it contains the domain of a universal self-delimiting Turing machine. Finally, we study various properties of these codes from the points of view of computability, maximality, and density.	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	On Universal Computably Enumerable Prefix Codes	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