An Algebraic Characterization of the Halting Probability
An Algebraic Characterization of the Halting Probability
Chaitin, Gregory
2007-01-01 00:00:00
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.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngFundamenta InformaticaeIOS Presshttp://www.deepdyve.com/lp/ios-press/an-algebraic-characterization-of-the-halting-probability-NOmQaFTluT
An Algebraic Characterization of the Halting Probability
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.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.