A statistical anytime algorithm for the Halting Problem

DOI10.3233/COM-190250zbMath1485.68119OpenAlexW2910610446MaRDI QIDQ5131647

Monica E. Bad Dumitrescu, Cristian S. Calude

Publication date: 9 November 2020

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-190250

zbMATH Keywords

order statisticshalting problemanytime algorithmrunning time

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Analysis of algorithms (68W40) Order statistics; empirical distribution functions (62G30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Computable model discovery and high-level-programming approximations to algorithmic complexity

This page was built for publication: A statistical anytime algorithm for the Halting Problem