Because, as Steve rightly pointed out with that Joslyn paper, the point is the extent to which the system submits to ordering. A strict hierarchy (levels, like I think EricS drew) submits to a total order, whereas a brranching hierarchy (still levels) submits to a partial order. Graphs work, but not as analogy, per se ... more like exact representations. The kinds of graphs I'd like to talk about don't (necessarily) submit to ordering, even partial ordering. (no levels) It would be more complete to say that any "ordering" would be more complicated than simple relations like ≥ or ≤.
On 06/08/2017 09:48 PM, Marcus Daniels wrote: > Why does there need to be any spatial property? Why not a graph? -- ␦glen? ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove
