Re: Idempotence and "Replication Insensitivity" are equivalent ?
From: <pamelafluente_at_libero.it>
Date: 25 Sep 2006 03:16:03 -0700
Message-ID: <1159179363.786375.238540_at_m73g2000cwd.googlegroups.com>
> Where did I say that?
> > I am the one who is saying that if you can't, your model is not useful.
> The type of function I'm talking about has interesting properties, both
> in terms op computational time and space complexity, as in
> optimizability through algebraic identities (which is important in the
> context of database theory).
> > one proves to be better ...
> Let me repeat: I consider discussion about definitions usually a waste
> of time.
Date: 25 Sep 2006 03:16:03 -0700
Message-ID: <1159179363.786375.238540_at_m73g2000cwd.googlegroups.com>
Jan Hidders ha scritto:
> pamelafluente_at_libero.it wrote:
> > Jan Hidders ha scritto:
> >
> > > pamelafluente_at_libero.it wrote:
> > > > Jan Hidders ha scritto:
> > > >
> > > > ... but in case of a Median date, how would you proceed?
> > > > Would it be all "postprocessing" ?
> > >
> > > Good question. Can you prove that it would be?
> > >
> > Ah ah :) It's just the other way round. It's you that are saying that
> > your definition is able to model it.
>
> Where did I say that?
>
> > I am the one who is saying that if you can't, your model is not useful.
>
> The type of function I'm talking about has interesting properties, both
> in terms op computational time and space complexity, as in
> optimizability through algebraic identities (which is important in the
> context of database theory).
>> > powerful and useful There is no need to stick with old theory if a new
> > [...] Why not opening the mind to some definition more
> > one proves to be better ...
>
> Let me repeat: I consider discussion about definitions usually a waste
> of time.
I agree on both.
-P
>
> -- Jan Hidders
Received on Mon Sep 25 2006 - 12:16:03 CEST