Program-Size Complexity Computes the Halting Problem

Show simple item record Chaitin, G.J en Arslanov, A en Calude, C en 2009-04-16T23:15:24Z en 2009-04-16T23:15:24Z en 1995-09 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-008 (1995) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri 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 en
dc.source.uri 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 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace