Program-Size Complexity Computes the Halting Problem

Chaitin, G.J; Arslanov, A; Calude, C

dc.contributor.author	Chaitin, G.J	en
dc.contributor.author	Arslanov, A	en
dc.contributor.author	Calude, C	en
dc.date.accessioned	2009-04-16T23:15:24Z	en
dc.date.available	2009-04-16T23:15:24Z	en
dc.date.issued	1995-09	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-008 (1995)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3517	en
dc.description.abstract	Can the halting problem be solved if one could compute program-size complexity? The answer is yes and here are two different proofs.	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	Program-Size Complexity Computes the Halting Problem	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