W3C home > Mailing lists > Public > www-rdf-logic@w3.org > June 2007

Algorithm

From: tianxama <tianxama@gmail.com>
Date: Fri, 22 Jun 2007 17:19:39 -0700 (PDT)
Message-ID: <11262050.post@talk.nabble.com>
To: www-rdf-logic@w3.org

Hi,
Is this yet discovered? :
 
1. Given a "potential value" of a given number made of digits, wich is the
reduction to one digit by succesive sum of its digits.
2. This value repeats in an interval (-(base-1)) - 0 - (base-1)
3. Let's call "weight" of a digit in the expression: (base pow
positionDigit) * digit
4. Assigning identifiers, given the case, in a specific interval it happens
that:
a. Given three nodes, left, right and parent with respective identifiers.
b. Maybe func(potentialValue(leftNodeID), potentialValue(rightNodeID)) ==
func(potentialValue(parentNodeID))

It's just an idea to develop how in a graph, reduced to a binary tree, one
can, for example, calculate regarding only in node identifiers, if two nodes
are interconnected and in how many and which type of leaps.

Regards,
-- 
[first: sebastián] [last: samaruga]
[email: tianxama@gmail.com] 
[url: http://www.simetris.com.ar]  
-- 
View this message in context: http://www.nabble.com/Algorithm-tf3967601.html#a11262050
Sent from the w3.org - www-rdf-logic mailing list archive at Nabble.com.
Received on Saturday, 23 June 2007 00:21:25 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:56 GMT