Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
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.
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Shu Tezuka
WSC 1991
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011