Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FUIN
2007

favoriteEmaildiscussreport

100views more FUIN 2007»

An Algebraic Characterization of the Halting Probability

13 years 4 months ago

An Algebraic Characterization of the Halting Probability

Download www.cs.auckland.ac.nz

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 selfcontained and not very complicated.

Gregory J. Chaitin

Real-time Traffic

Algebraic Characterization | FUIN 2007 | Halting Probability | Word Problem |

claim paper

Related Content

» A New Characterization of Probabilities in Bayesian Networks

» Varieties Generated by Certain Models of Reversible Finite Automata

» Parametric Structure of Probabilities in Bayesian Networks

» Duality for Labelled Markov Processes

» Models for Incomplete and Probabilistic Information

» A Spectral Approach for Probabilistic Grammatical Inference on Trees

» On the Complexity of Nash Equilibria and Other Fixed Points

» The Metric Analogue of Weak Bisimulation for Probabilistic Processes

» Grammatical inference as a principal component analysis problem

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	FUIN
Authors	Gregory J. Chaitin

Comments (0)