A probabilistic anytime algorithm for the halting problem

Cristian S. Calude, Monica E. Bad Dumitrescu · Computability · 2017

The Halting Problem, the most (in)famous undecidable problem, has important applications in theoretical and applied computer science and beyond, hence the interest in its approximate solutions. Experimental results reported on various models of compu

Read the paper · More papers on PaperTik