{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:50Z","timestamp":1772163950217,"version":"3.50.1"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2015,6]]},"abstract":"<jats:p>A program which eventually stops but does not halt \u201ctoo quickly\u201d halts at a time which is algorithmically compressible. This result \u2014 originally proved in [4] \u2014 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-off temporal bound) cannot be significantly improved.<\/jats:p>","DOI":"10.1142\/s0129054115500252","type":"journal-article","created":{"date-parts":[[2015,8,5]],"date-time":"2015-08-05T06:50:47Z","timestamp":1438757447000},"page":"465-475","source":"Crossref","is-referenced-by-count":3,"title":["Anytime Algorithms for Non-Ending Computations"],"prefix":"10.1142","volume":"26","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand"}]},{"given":"Damien","family":"Desfontaines","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, 45 rue d\u2019Ulm, 75005 Paris, France"}]}],"member":"219","published-online":{"date-parts":[[2015,8,5]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207168208803297"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2007.01.001"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.07.003"},{"key":"p_6","first-page":"7","volume":"44","author":"Calude C. S.","year":"2005","journal-title":"International Journal of Theoretical Physics"},{"key":"p_8","first-page":"1","volume":"3","author":"Grass J.","year":"1996","journal-title":"Magazine Crossroads"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1168352664"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129511000508"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054115500252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:38:55Z","timestamp":1565134735000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054115500252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2015,8,5]]},"published-print":{"date-parts":[[2015,6]]}},"alternative-id":["10.1142\/S0129054115500252"],"URL":"https:\/\/doi.org\/10.1142\/s0129054115500252","relation":{"has-preprint":[{"id-type":"doi","id":"10.31219\/osf.io\/9y5nv","asserted-by":"object"}]},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}