On Dec 27, 7:57 am, John Jones <jonescard...@xxxxxxx> wrote:
Clearly, we may provide a solution to the Russell paradox, a function is not
its object.
Oh ixnay. A function being its object is the basis for
diagnoalization to wit a Turing Machine that tells if a Turing Machine
halts, a wff that expresses and/or represents whether a given wff is
provable.
Re: Contradiction or paradox ... and ~_is_ a wff by that definition. ... ~LTand then halts.... The rest of the line is CBL command write with argument ... YES"Turing Machine a halts yes on input b." ... (sci.logic)
Re: Rados Sigma and the Halting Problem for Programs ... AD> computer language that does not contrive a logic paradox ...Halting Theorem may be proven without recourse to reductio ...computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ... (comp.theory)
Re: Rados Sigma and the Halting Problem for Programs ... AD> computer language that does not contrive a logic paradox ...Halting Theorem may be proven without recourse to reductio ...computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ... (sci.math)
Re: Rados Sigma and the Halting Problem for Programs ... AD> computer language that does not contrive a logic paradox ...Halting Theorem may be proven without recourse to reductio ...computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ... (sci.logic)
Re: Disproof of the Halting Problems Conclusion ... The "head" of a Turing machine is always located at some cell of the ... block of n+1 X's on an otherwise blank tape, M halts at the leftmost X ... (comp.theory)
