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
Chai Wah Wu
Linear Algebra and Its Applications
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings