A probabilistic anytime algorithm for the halting problem-Reference-Cited by-同舟云学术

A probabilistic anytime algorithm for the halting problem

Published:2018-06-07 Issue:2-3 Volume:7 Page:259-271
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Calude Cristian S.¹,Dumitrescu Monica²

Affiliation:

1. Department of Computer Science, University of Auckland, Auckland, New Zealand. cristian@cs.auckland.ac.nz.

2. Faculty of Mathematics and Computer Science, Bucharest University, Romania. mdumi@fmi.unibuc.ro.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference31 articles.

1. B.C. Arnold, N. Balakrishnan and N.N. Nagaraja, A First Course in Order Statistics, John Wiley, New York, 2008.

2. L. Bienvenu, D. Desfontaines and A. Shen, What percentage of programs halt?, in: Automata, Languages, and Programming I, M.M. Halldórsson, K. Iwama, N. Kobayashi and B. Speckmann, eds, LNCS, Vol. 9134, Springer, 2015, pp. 219–230.

3. Efficient sampling methods for discrete distributions;Bringmann;Algorithmica,2016

4. C.S. Calude, Information and Randomness: An Algorithmic Perspective, 2nd edn, Springer, Berlin, 2002.

5. Universality and almost decidability;Calude;Fundamenta Informaticae,2015

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using graph neural networks for program termination;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

2. Computable model discovery and high-level-programming approximations to algorithmic complexity;Theoretical Computer Science;2022-08

3. Gödel Incompleteness and Proof-Assistants Extended Abstract;2021 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2021-12

4. Imitation Game: Threshold or Watershed?;Minds and Machines;2020-10-21

5. A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions;Entropy;2020-05-30