you know, while writing these i often find myself, trying to cram as much information and encoded wisdom, as i can, for example just now i was reading, A Theory of Distributed Time, in an attempt to show you, what I've been saying, about intention shaping reality, Formally, a time model is a particular way of transforming one set of computation graphs into another set, presumably more abstract. Concomitant with this transformation is a notion of representation: an atom in the transformed graph may represent a set of atoms in the original graph. Time models usually depart from physical reality in order to better express some underlying conceptual structure. building computation graphs requires bundling process activity into discrete packages called events. We identify events, the basic things that happen, with their nodes. Events are atomic in the sense that they provide the fundamental level of granularity in the computation graph: in this graph, one cannot talk about anything finer. such as what we think may happen, or what we think, will be observed, (a hypothesis doesnt make it a fact), The label on an event should describe that event, in sufficient detail for the level of abstraction, in this graph-for example, if a graph represents what a process perceives about a computation, the labels should make no reference to things that process cannot observe, such as real time. edges represent transitions between events. In more general graphs, the edges will represent a temporal relation on events-the order in which they happen. A temporal relation is a binary precedes relation on a collection of elements, (which, in this paper, will be events). We write A - B to indicate that event A precedes event B in this relation.
We also use some variations: "
* A B when A-%B or A=B
"* A - B when A does not precede B
"• A•B•BwhenA ---BorA= B
"* A4-/ B when neither A -B nor B --- A
A relation is transitive when (for any events A, B, C) if A -- B and B - C C then A --- C.
A relation is antisymmetric when A - B and B -- A cannot both hold for A # B. A relation
is irreflexive when no A -- A. A partial order is a relation that transitive, antisymmetric, and
irreflexive; a total order is a partial order that is complete: for any A -: B either A -. B or
We introduce a new term: a linear time order is a partial order where concurrency is an
equivalence relation whose equivalence classes induce a total order. In a linear time order, we can
assign each event A a real number T(A), such that T(A) < T(B) iff A -- B, for distinct A, B.
(A linear time order is just a total order, that allows for simultaneous events), and that is how universes arise and fall, and are borne again, over and over and over, there are multiple universes, borne from every choice we make, and potentially make as, standardz, hahahahahahaha, :) #edio