2012-04-07

the internet is a cloud of pages (url.s) .
to make a link language, every page gets a knot (node, index) to manage the page .
among other items there is a link to the page and a link to a list of back links .
we link the pages no longer within the pages, but use a separate structure (knot of knots) .
so we can automaticly make a back link if we use a link .
(in memory of “backrub” we can call it “backrub2”)

the relationship is not defined, we create it yourself (*)
therefore we have connection notation (signs like + – = : & @ …) with wich we can make binary trees .
each binary tree has two objects and a connection, e.g. B @ A, where A can be the knot of a page and B (C, D, E ..) the knot of a comment .
this allows us to make our own common internet, a tree of trees :

A -> 1
B -> 1
C -> 2
D -> 3
E -> 4

1 : B @ A -> 2
2 : C @ 1 -> 3
3 : D @ 2 -> 4
4 : E @ 3

say: you are the owner of the page with the knot A, then you look at A and find -> 1, -> 2, -> 3, -> 4 .
on B you also find -> 1, -> 2, -> 3, -> 4 .
to handle this we need a tree browser .

(*) this is very important because it allows a new way of thinking (look at google: they want to make a semantic search and try to fill a query structure with contents, but that’s not the future . instead they should use our tree of trees) .


< time-line-2/,  my-personal-board/

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: