Computational Representation

The parse graphs we’ve been looking at so far bring us one step closer to the pointer graphs it takes to make the above types of maps and trees live in computer memory but they are still a couple of steps too abstract to detail the concrete species of dynamic data structures we need.  The time has come to flesh out the skeletons we have drawn up to this point.

Nodes in a graph represent records in computer memory.  A record is a collection of data conceived to reside at a specific address.  The address of a record is analogous to a demonstrative pronoun, a word like this or that, on which account programmers call it a pointer and semioticians recognize it as a type of sign called an index.

Resources

• Logical Graphs
• Survey of Animated Logical Graphs

cc: FB | Logical Graphs • Laws of Form • Ma^thstodon • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science