User:Jack
- Project document for Human consumption
- The two domains (Fourier transforms, energy and matter)
- Relative Traversal (List-Space)
- key-as-hashref (What does it mean conceptually to use a hash-ref as a hash-key?)
- Nodal-space vs List-space(Node-Space))
- xhtml.jpg
- Jack/Todo
- Binary
I was thinking that a good foundation for a lot of other discussion is the concept of binary in general. Binary is the simplest form of distinction, and the bit is the most fundamental unit of information. Binary and is not only made of two states, or symbols, but also gives rise to two different ways when considering sets of bits. These two basic ways are the root of the two domains.
- Names: The using of the binary sequence simply as being distinct from all other sequences. In the nodal model, traversal is used to assign distinct sequences to a particular piece of information.
- Number: A simple geometric which compliments traversal gives rise to ordered sequence, and using recursion is infinetly divisable. Ie a discrete process which forms a continuum. In the nodal model, the geometry is based on this method - recursively dividing a window or period.
- Nodes
- Each node is a list of associaitons (key:value but not strings)
- There are four fundamental ones common to all nodes
- prev/next and parent/current (they can be called axes, horizontal and vertical)
- each node is part of a loop of nodes formed by following prev/next associations, all the nodes in the loop are currently siblings.
- each node receives its quanta from the node at the end of its parent association, and sends its quanta to the current'-association (and rotating current to next)
- each nodes child associations the current-association takes us to the ite
- Associations
- associations are class:instance relationships
// instance.create/delete(class) calls class.create/delete(instance) // create inserts the instance into the classes instance-loop (list-aspect, next/prev) // ie. our list of current children (that our E divides amongst) is also our instance-loop // has or is are one, they're all just relationships that receive a portion of energy // laster: a chain of delegate classes is created between root and the instance // - the class of any assoc requires a portion of the quanta // remember, next/prev and complimented by parent/current (parent is also class) // - this allows alternate quanta be divided between parent and current, thus providing // energy for the class->instance relationship // - get retreives from class value if no instance value at each step of a path
// REDUCTION // - all instance-loops work by going cd this.current then assigning this.current.next to it // when a function executes, it can update the loop at that location (equiv to array.push) // - a functions parameters (and even further methods and tools) are child associations // the structures necessary to build the fucntion are child assocs too
