科研之友
微信
新浪微博
Facebook
分享链接
摘要
A 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 Mania [11] we convert the result into an anytime algorithm for the halting problem and we show that the stopping time (en off temporal bound) cannot be significantly improved.
- 出版日期2015-6
