Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
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.
Igor Devetak, Andreas Winter
ISIT 2003
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003