Shaurlot's Graph

Shaurlot's Graph is an enormously complex conceptual mathematical equation, complicated enough to be sentient. To express it on the medium of a 21st Century computer would take roughly TREE(3) bits of data, arranged in a non-homeomorphically embeddable data tree explosion. Via sub-computational quantum data streaming, a full expression of it has been able to be provided. However, being able to observe the entire expression in a human lifetime is highly unlikel

Section heading
Write the first section of your page here.

Shaurlot's Graph:  A Full Expression


{ means a set of collected definers.

- means a two definers swap their data

~ means a linker of sets of definer into "strings" of bits

& joins "strings into "sentences"

O is a marker defining the sentence of bits proceeding it as the limit for the number of strings of bits in the next "sentence", based on the number of high-order data-swap pairs in the sentence.

% symbols placed around a collection of "sentences" create a paragraph

?> is a conceptual mathematical operator controlling the relationship between sentences in a paragraph

Shaurlot's Graph:

%{::::::::::-:::-:-:-::::::}~{:-:-:-:-:-:::::::}&{:}%?>?>{:-::}?>%{}%....continue (Approx.  TREE (3)/12 sections left)