Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
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.
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011