[Date Prev][Date Next][Thread Prev][Thread Next][Author Index][Date Index][Thread Index]
Re: Presentation on Xanalogical Data Structures
- To: Jeff Rush <jeff@xxxxxxxxxx>
- Subject: Re: Presentation on Xanalogical Data Structures
- From: roger gregory <roger@xxxxxxxxxxxxxxxxxxxxx>
- Date: 13 Aug 2004 11:35:32 -0700
- Cc: "udanax@xxxxxxxxxx" <udanax@xxxxxxxxxx>, "xanadu@xxxxxxxxxx" <xanadu@xxxxxxxxxx>
- In-reply-to: <1092379424.28433.17.camel@xxxxxxxxxxxxxxxxxxxx>
- References: <1088593794.19829.81.camel@xxxxxxxxxxxxxxxxxxxx> <1091854291.4865.14.camel@xxxxxxxxxxxxxxxxxxxx> <p06002005bd3d69f7ba3f@[10.0.1.102]> <1092290997.10235.82.camel@xxxxxxxxxxxxxxxxxxxx> <p06002003bd41439641cb@[10.0.1.102]> <1092379424.28433.17.camel@xxxxxxxxxxxxxxxxxxxx>
> In ISO when describing TCP/IP, they hang bridges btw middle layers,
> indicating the logical link layer exchanging packets. I think I can
> represent the BE-BE interface the same way.
>
> But no, Green doesn't implement the BE-BE interface at all.
>
Now that the internals aren't secret, the BE-BE protocol need not be
mysterious it just has to convey the information about I addresses as
well as V addresses.
A major deficiency in green is the inability to edit links. I think all
the structure is there to retrieve the link and for each span remove the
link from the span and remove that span from the SPANF if it doesn't
belong in any other link. Not too hard, but given all the other
deficiencies of green I'm not up to it right now.
I've got a lot more to say, but I've been busy with the rocket and NASA
proposal stuff. I think our hypertext approaches could generate NASA
research money, if we wanted to get a crew together to work on it. Any
real interest?
--
Roger Gregory
2207 17th Avenue
San Francisco ca 94116
415 664-6850 home
415 572-9634 cell
roger@xxxxxxxxxxxxxxxxxxxxx
http://www.halfwaytoanywhere.com