Re: logic of the Cantorian followers mind

From: Josh Purinton (google-noreply.a.jp_at_xoxy.net)
Date: 11/29/04 

Date: 28 Nov 2004 23:30:09 -0800

"Poker Joker" <Poker@wi.rr.com> wrote in message news:<ps7pd.91561$T02.86171@twister.rdc-kc.rr.com>...
> I've been told Cantor's proof has nothing to do with computability.

Diagonalization is a powerful technique with many applications. It can be
used to show, among other things, that there are uncomputable functions
from N -> N.

> I don't find it strange that I was able to lead you here though.

The concept of computability relates to the existence of unidentifiable
real numbers insofar as there is to be an effective method for
distinguishing between identifiers.

Relevant Pages

  • Re: logic of the Cantorian followers mind
    ... Diagonalization is a powerful technique with many applications. ... The concept of computability relates to the existence of unidentifiable ...
    (sci.logic)
  • Re: logic of the Cantorian followers mind
    ... Diagonalization is a powerful technique with many applications. ... It can be used to prove, among other things, the existence ... Computability relates to the existence of unidentifiable ...
    (sci.logic)
  • Re: computability not in undergrad?
    ... >> about computability. ... I suspect Lintz doesn't just explain the ... > But it does not even mention diagonalization. ... > accept a proof based on state transition diagrams? ...
    (sci.logic)
  • Re: computability not in undergrad?
    ... >>that's a perfectly good framework for proving thorems about ... >>computability. ... I suspect Lintz doesn't just explain the Halting ... > But it does not even mention diagonalization. ...
    (sci.logic)