Chaitin Numbers and Strong Reducibilities
نویسنده
چکیده
We prove that any Chaitin number (i.e., the halting probability of a universal self-delimiting Turing machine) is wtt-complete, but not tt-complete. In this way we obtain a whole class of natural examples of wtt-complete but not tt-complete r.e. sets. The proof is direct and elementary.
منابع مشابه
Cdmtcs Research Report Series Chaitin Numbers and Strong Reducibilities
We prove that any Chaitin Ω number (i.e., the halting probability of a universal self-delimiting Turing machine) is wtt-complete, but not tt-complete. In this way we obtain a whole class of natural examples of wtt-complete but not tt-complete r.e. sets. The proof is direct and elementary.
متن کاملChaitin Ω Numbers , Solovay Machines , and Incompleteness
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC...
متن کاملDedicated to G. J. Chaitin for his 50th Birthday Recursively Enumerable Reals and Chaitin Numbers?
A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay [23] and Chaitin [10] we say that an r.e. real dominates an r.e. real if from a good approximation of from below one can compute a good approximation of from below. We shall study this relation and characterize it in terms of relations between r.e. sets. Sol...
متن کاملStrong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets
GavaldB, R. and J.L. BalcBzar, Strong and robustly strong polynomial time reducibilities to sparse sets, Theoretical Computer Science 88 (1991) I-14. Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class NPncoN...
متن کاملChaitin numbers , Solovay machines , and G % odel incompleteness
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC...
متن کامل