Re: An instance of Russell's paradox?

Jim Spriggs wrote:

> > 1. Can all algorithms be enumerated,
>
> Yes. An algorithm can be expressed in finite terms in a formal
> language. Therefore there are no more than countably many of them.

I think I must do a lot more thinking here.

> > or will that be another
> > formulation of Russell's paradox
>
> Diagonalize out of your enumeration to prove that not all functions are
> algorithmic.

So it has to do with Cantor's diagonalization. I need to study a lot
more, and there is just one thing I know, I will never give up.

> > (with the list of all algorithms being
> > another way of expressing the set of all sets)?
>
> No, just a confusion.
>
> (I'm amused by Eagleson's "I hope I am clear.")

:-)

I don't know who you are Sir, or where you come from,
but you've done me a power of good.

Thank You very much indeed.
Tom

.

Relevant Pages

  • Re: Wrote a little encryption program. How can you tell how good it is?
    ... >> respectable languages for expressing algorithms as well. ... >> seriously by others in this news group if you expressing algorithms in ... > language has upsides and downsides. ...
    (sci.crypt)
  • Re: An instance of Russells paradox?
    ... > difficulties which I seem to be unable to overcome on my own. ... Can all algorithms be enumerated, ... Diagonalize out of your enumeration to prove that not all functions are ... > another way of expressing the set of all sets)? ...
    (sci.logic)
  • Re: An instance of Russells paradox?
    ... > Prolog is seriously not a good choice for that. ... Can all algorithms be enumerated, ... > only if you can formulate the enumeration algorithmically. ... > upon these finite arities, ...
    (sci.logic)
  • Re: An instance of Russells paradox?
    ... Prolog is seriously not a good choice for that. ... Can all algorithms be enumerated, ... only if you can formulate the enumeration algorithmically. ... upon these finite arities, it might ...
    (sci.logic)
  • Re: An instance of Russells paradox?
    ... Can all algorithms be enumerated, ... >Diagonalize out of your enumeration to prove that not all functions are ... list of total functions will be another total function which is ...
    (sci.logic)