# Re: Object-relational impedence

Date: Tue, 4 Mar 2008 10:13:31 +0100

Message-ID: <1krhgpmbt84n6.10d76dsw25anz.dlg_at_40tude.net>

On Mon, 03 Mar 2008 19:02:40 -0400, Bob Badour wrote:

> One can represent any graph on two-dimensional media just as one can

*> represent any relation on two-dimensional media. In fact, since a graph
**> is merely a set of vertices and a set of directed edges and since one
**> can easily represent vertices and directed edges as tuples, one can
**> easily represent any graph using relations.
*

In fact graph *is* a binary relation over the set of nodes. The notation used in graph theory is relational. For instance, edges are denoted as aGb. G is the graph. So what?

That proves / refutes nothing. Observe that any program is an integer number. This certainly should make integer arithmetic hugely useful in for software design. Let Windows XP be n, then to n+m would be Vista, n/2 would Windows ME...

Argumentation to Turing/other-completeness is a fallacy in software design disciplines.

-- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.deReceived on Tue Mar 04 2008 - 10:13:31 CET