Yes, it *sounds* like that's where I'd like to go with the conversation. The
original post Nick made was about propagating meaning through a nesting
(objects, statements about objects, statements about statements about objects,
...) as well as openness to material flow (river vs. the components of the
river) while holding an attribute/pattern invariant.
The extent to which a binding ("d" in the slides, measured attributes/patterns
in Nick's setup) can be reasoned over depends fundamentally on the reasoning
graph used. A generalization (or abstraction?) can only hold if the path from
it's original binding to the block where you want to use it is "followable" in
some sense.
I don't quite understand the reducibility being discussed in the slides,
though. So, I'm unable to map the idea of "invariance of an abstraction" onto
reducibility of the loops in those graphs. I'm also not clear on which
direction we really want to go, FROM the concrete fact (d) TO the abstraction
(block(s) of logic) *or* in reverse, FROM the abstraction TO the fact.
The extra sauce you add that some (loopy?) programs might only implementable
with GOTO applies directly to the discussion of control vs. composition
hierarchies. My favorite example right now is the seratonin produced by gut
microbes, which finds its way to the brain. While it's convenient to suggest
the brain (organ) is composed of brain tissues matrixed by inter-brain-tissue
components like neuron-released seratonin, where in that hierarchy do we
force-fit the gut?!? 8^) It's like some sort of undeniable interrupt
semaphore from outer space ... messages from the Dog Star.
On 1/8/19 7:57 AM, Marcus Daniels wrote:
> Maybe this wasn't the direction you were going, but I was thinking of the
> distinction between reducible vs. non-reducible loops. Where one (a
> compiler) can collapse cycles into single nodes. One could assert that
> certain programs could only be written using a GOTO spaghetti style but I
> don't think many people would believe that.
>
> http://infolab.stanford.edu/~ullman/dragon/w06/lectures/dfa3.pdf
--
∄ uǝʃƃ
============================================================
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
archives back to 2003: http://friam.471366.n2.nabble.com/
FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove
