Chaitin, G.JArslanov, ACalude, C2009-04-162009-04-161995-09CDMTCS Research Reports CDMTCS-008 (1995)1178-3540http://hdl.handle.net/2292/3517Can the halting problem be solved if one could compute program-size complexity? The answer is yes and here are two different proofs.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of Research::280000 Information, Computing and Communication SciencesThe author(s)http://purl.org/eprint/accessRights/OpenAccess