I have this Javascript view of computing

Really, what is computing all about.

There is a machine, the micro processor, and it does one thing, it solves the tuple <arg1,op1,arg2> and the solution to that tuple tells the machine to step right one node, or drop down one node, thus skipping around a linear memory as if it were a compact graph representation. .  It treats the world as a compact graph ( a linear stuffing of a linked graph). The machine  does that until it is powered off.

What is the deal about objects?
Here  the hullaballo, in graph language:

Go down one,
then shift right until you find your method,
then shift down for execution.
then retrace one step and resolve

Basically that is a Javascript interpreter.  If the graph has no loops, then this is a convolution of two finite graphs, eventually the microprocessor finishes and powers down.

It was my point when I was doing the semantic processor.
Ultimately we have, for the microprocessor, linear object code, actual bunches of electrical charge sitting in the linear array of charge holding buckets.  But, if that array of charges is Turing complete,then it can be viewed as a compact representation of a spanning graph with no loops.  By compact I mean any sub graph is contained within a master graph.

 Then any collection of data, is so likely presumed such that, both being finite, a node by node convolution of the two yields another output graph, also a compact representation with no loops.  Everything finite.  A little theory tells us this is so when we show there is no other minimal representation of a graph in linear memory.