transitive closure again

From: paul c <toledobythesea_at_oohay.ac>
Date: Fri, 04 Nov 2005 23:06:02 GMT
Message-ID: <uPRaf.411888$tl2.327979_at_pd7tw3no>

Here's one for the theorists (further to the thread from a month or two ago where I said some nonsense about obtaining the closure without recursion and which has been proved wrong many times and although I find the proofs hard to follow).

Let me turn it around and ask a converse question:

If we have a relation that is the closure (including trivial relationships if necessary), can we obtain what Mikito (if I recall), calls the adjacency list, using the RM algebra but without recursion?

cheers,
pc Received on Sat Nov 05 2005 - 00:06:02 CET

This message: [ Message body ]
Next message: Mikito Harakiri: "Re: transitive closure again"
Previous message: vc: "Re: Lock-free databases"
Next in thread: Mikito Harakiri: "Re: transitive closure again"
Reply: Mikito Harakiri: "Re: transitive closure again"
Reply: Vadim Tropashko: "Re: transitive closure again"

Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

Original text of this message