Calude, CSDesfontaines, D2015-01-052015-01-052014CDMTCS Research Reports CDMTCS-463 (2014)1178-3540http://hdl.handle.net/2292/23906A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmically compressible. This result—originally proved in [4]—is proved in a more general setting. Following Manin [11] we convert the result into an anytime algorithm for the halting problem and we show that the stopping time (cut-o! temporal bound) cannot be significantly improved.Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of ResearchThe author(s)http://purl.org/eprint/accessRights/OpenAccess