[CG] Re: Logical Graphs • First Impressions

Logical Graphs • First Impressions 7 • https://inquiryintoinquiry.com/2023/08/24/logical-graphs-first-impressions/ 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 which can be 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”. Regards, Jon cc: https://www.academia.edu/community/VjoJ6L cc: https://mathstodon.xyz/@Inquiry/110945139629369891