M. Tismenetsky
International Journal of Computer Mathematics
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω. Our proof closely follows a 1978 formulation of Post's work by M. Davis. The proof is self-contained and not very complicated.
M. Tismenetsky
International Journal of Computer Mathematics
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Matthew A Grayson
Journal of Complexity