Re: Operationalize orthogonality

From: x <x_at_not-exists.org>
Date: Tue, 30 May 2006 09:51:13 +0300
Message-ID: <e5gprg$795$1_at_nntp.aioe.org>


"Pickie" <keith.johnson_at_datacom.co.nz> wrote in message news:1148938551.918883.18840_at_y43g2000cwc.googlegroups.com...
>
> Tony D wrote:
> > The only type absolutely required is the boolean type. You could (and I
> > stress, *could*) attempt to model everything from there on up in terms
> > of relations and booleans, but that would require a frightening degree
> > of circumlocution.

> How would you represent a count (IE the non-negative integers) using
> only booleans and relations? How would you represent a text string? I
> ask because these seem to me to be basic concepts (or primitive types?)
> and both of them have simple ways to represent a boolean (zero and
> empty string respectively being false, all else true).

I think you store those counts or strings in memory encoded as bits. Received on Tue May 30 2006 - 08:51:13 CEST

Original text of this message