Re: Cantor For Dummies ...
- From: "georgie" <geo_cant@xxxxxxxxx>
- Date: 28 Mar 2007 17:20:31 -0700
On Mar 28, 2:40 pm, riderofgiraffes <mathforum.org...@xxxxxxxxxxxxxx>
wrote:
I'm sorry, but I can't understand the point you're
tryng to make. You seem to be writing a great deal,
and trying to explain something, but it never seems
to be relevant to what I've described.
I write very little. You understand less.
What I've been saying is this:
I have an algorithm such that
If you have a algorithm for generating
a list of committees, then
my algorithm generates a committee
that your algorithm doesn't generate.
I don't have an algorithm. If we list all the
algorithms that generate a committee ... then
your algorithm is on that list.
This seems to be irrelevant, but I'll try to follow
what you say, and point out where I fall off.
There's your whole problem. You fall alot.
In particular, let's do as you say and list all the
algorithms that generate a committee. My algorithm
is in fact not on that list.
Your algorithm is in the set of all algorithms or its
not an algorithm.
My algorithm does not
simply generate a committee. My algorithm takes a
list of committees and generates a committee not on
the list.
So which is it? It generates a committee or it doesn't.
Do you agree that my algorithm does that?
Does what? Generates a committee or doesn't?
Let's suppose that you meant that.
Meant what? You are the one trying to make a point.
So let's suppose we take a list of all algorithms
that take a list of committees and from that list
generate a committee.
Let's go one step further and consider all algorithms
that output a committee.
Any committee, on the input
list or not.
Certainly my algorithm will be on that list of
algorithms.
If it is truly an algorithm and it generates a committee.
The output of all those algorithms is unattainable,
but nevertheless, platonistically exists.
Well, now I'm struggling to understand what you mean
by that. Each of these algorithms takes a list of
committees, and you haven't told me what to feed them
as that input.
Thats not relevent. We are considering all algorithms
that output a committee. If you want a discussion about
other algorithms, then discuss it with someone else.
If you're saying that the committees don't need input,
then we're back to the situation that my algorithm is
then not one of them.
That's right. It must not be an algorithm and therefore
it doesn't generate a committee.
Your algorithm can't possibly operate on its own
output, ...
No, agreed. It doesn't try to, it doesn't have to.
My algorithm takes a list of committees and produces
one committee not on the list. What you're saying
doesn't appear to be relevant.
Since we can list all algorithms that generate committees
by whatever means, we can list their outputs. The list
of outputs would contain the output of your so-called
algorithm. Your algorithm can't operate on a list
of committes that include your so-called algorithm's
output. Therfore no such algorithm exists.
... so what you have been saying makes no sense.
You don't seem to have made clear what makes no sense.
What doesn't make sense is that you claim that your
algorithm can take its own output as an part of its
input.
I trust I've been able to explain why your reply
seems unclear to me, and I look forward to your
response.
.
- Follow-Ups:
- Re: Cantor For Dummies ...
- From: riderofgiraffes
- Re: Cantor For Dummies ...
- References:
- Re: Cantor For Dummies ...
- From: georgie
- Re: Cantor For Dummies ...
- From: riderofgiraffes
- Re: Cantor For Dummies ...
- Prev by Date: Re: Transforms between ellipses
- Next by Date: Re: Topology with second-countable and basis.
- Previous by thread: Re: Cantor For Dummies ...
- Next by thread: Re: Cantor For Dummies ...
- Index(es):
Relevant Pages
|
Loading