Chaitin's Constant - Relationship To The Halting Problem

Relationship To The Halting Problem

Knowing the first bits of, one could calculate the halting problem for all programs of a size up to . Let the program for which the halting problem is to be solved be N bits long. In dovetailing fashion, all programs of all lengths are run, until enough have halted to jointly contribute enough probability to match these first N bits. If the program hasn't halted yet, then it never will, since its contribution to the halting probability would affect the first N bits. Thus, the halting problem would be solved for .

Because many outstanding problems in number theory, such as Goldbach's conjecture are equivalent to solving the halting problem for special programs (which would basically search for counter-examples and halt if one is found), knowing enough bits of Chaitin's constant would also imply knowing the answer to these problems. But as the halting problem is not generally solvable, and therefore calculating any but the first few bits of Chaitin's constant is not possible, this just reduces hard problems to impossible ones, much like trying to build an oracle machine for the halting problem would be.

Read more about this topic:  Chaitin's Constant

Famous quotes containing the words relationship to, relationship, halting and/or problem:

    Film music should have the same relationship to the film drama that somebody’s piano playing in my living room has to the book I am reading.
    Igor Stravinsky (1882–1971)

    ... the Wall became a magnet for citizens of every generation, class, race, and relationship to the war perhaps because it is the only great public monument that allows the anesthetized holes in the heart to fill with a truly national grief.
    Adrienne Rich (b. 1929)

    People seldom see the halting and painful steps by which the most insignificant success is achieved.
    Anne Sullivan (1866–1936)

    I tell you, sir, the only safeguard of order and discipline in the modern world is a standardized worker with interchangeable parts. That would solve the entire problem of management.
    Jean Giraudoux (1882–1944)