Archive for June, 2006

Yesterday it was the PILE PETER Universe, let’s try a PILE ‘representation’ of a TGraph today. TGraphs, i.e. typed, attributed, and ordered directed graphs, were introduced by (Ebert/Franzke 1995), see the reference at the end of this post.
Our PILE (learning environment) user/agent likes to deal with a TGraph now. The following figure shows A TGraph [...]


Talking about the Pile Interactive Learning Environment (PILE) is talking about notation first.

Let there be different kind of entities:

transitions (arcs)
events
responses (actions)
circles (forms)
horizontal dotted lines

In the figure (a) above, we see an arc, i.e. a transition. Transitions are annotated by an event symbol (like a) and an optional response symbol (like x), which are separated by [...]


We rediscover an application of the Cauchy/Cantor Diagonal Method in the area of information systems described by W. T. Hardgrave in the Mid-Late 1970’s.


Please find the abstract draft of a paper, which I'd like to write sometimes , and feel free to comment on this:
The first axiom of Stathis' Multiple Forms Logic serves as starting point to bootstrap a Pile system: All is One, and All contains any distinction. Then we partition the oneness of All over [...]


Quoted document:
Weston, Paul E. (1966): Counting binary, rooted trees. arboreal numbers of the first and second kind. In: Ryan, Hollis F.; Weston, Paul E. (Hg.): Rooted trees. BCL Report No. 2.0. Urbana Ill., p. 1–26., p. 5.


Halo

07Jun06

Weston, Paul E.; Tuttle, H. (1967): Data structures for computations within networks of relations. B.C.L. Report No. 67.2, p. 35–37., p. 37.


Some clickable line art

to modify my earlier description of bootstrapping a PSystem, which you can find here.
We start with Stathis' first axiom again.
We need two Pile_Objects to define the origin(s) of our two-dimensional Pile Space (short: PSpace). As result, there are two Pile_Objects sitting on a line (the Diagonal of our 2D Cartesian PSpace): #0 [...]



Flatland

03Jun06

e

03Jun06