3D Printer

I don't want a box or platform type, because it can only produce objects smaller than it. A small one can't make big things, and a large one takes up too much space. I just want a small 3D printing head which can be dynamically mounted and unmounted on a flexible mechanical tentacle, can move anywhere to print objects larger than it without size restrictions. 

Why can the design of the simplest structure required to satisfy all like Sense not be submitted to the patent office? It will not be easy to modify to achieve the best if it is submitted to the standards office before it is designed to be perfect. If it is submitted to the patent office, it will form a barrier hindering the optimization process. We are hoping the whole world uses this basic structure, it certainly cannot let people bypass the patent for avoiding paying a fee. Otherwise, it will form several mutually exclusive structures with different advantages and disadvantages, but there will be no best one. It is not easy to find the best universal structure, how can we let people go away from it? 

The position of the Sense is like the Object of the software revolution at the end of the last century.

The graph traveling: the traditional way is addition and multiplication of the address number; the new way is the switch shifting on the array. 

A program is segments of collection or class graph traveling until blank or separator.

One way is to dynamically connect the results of each traveling by their association behaviour definitions to wait for value input to start the computation to output and then the connection perhaps be modified or released after each computation, but this way will consume so many dynamic allocated buses and switches for netlist.

The other way is to directly replace the series of traveling results by their synonym definitions as computation.

Virtual operator

The number of gates in the original truth table of the arithmetic and logic unit, before the AND and OR gates simplification, is almost equivalent to the memory unit. The two inputs of the original truth table are used as the 2D address of the memory module to store the output. After the address is read, it is equivalent to two inputs and one output. This is the so-called "memory operator". For a single fixed function operator, it is impossible to use this method to consume the largest number of gates without simplification; for a large number of fixed operators, the complexity of virtual wiring among operators that can only be fixedly placed consumes more memory units than those that can be rewritten and freely placed to reduce the complexity of virtual wiring. So, it is cost-effective.

The other method of content addressing, rather than the numerical decoder addressing, is to use a comparison gate array to compare the content with the input to locate and access the adjacent content. When the number of units is large enough, the number of gates consumed by the numerical address decoder exceeds the number of gates consumed by the parallel content comparison. The numerical address decoding method can only determine one address, and the content comparison method can have multiple connections. For dynamic logic operations, "memory and computation in one" is more cost-effective. Operators and operands in traditional neural networks are fixed side by side without addressing problems; a dynamic neural network with dynamic connections among neurons that change frequently, instead of being fixed, is more suitable for this approach.

Of course, the ultimate "memory and computation in one" is that the semiconductor itself is a non-volatile memory, instead of adding another memory side by it to remember the switch state.

Sense

The entire space has only one type of unit structure which can compose all types of operations and data structures.

We call it Sense:

§

Sense code

(

Sense code as link type 

(

Sense code to link|

......

)

......

)

A fixed unit slot of a flexible Sense code:

used { Boolean 

reserved { Boolean 

head { Boolean

tail { Boolean

code { Nibble 

Denotation of a nibble:

0 1 2 3 4 5 6 7 8 9 . | ( ) $ § 

More than one nibble to denote the other characters. 

$ before a Sense code denotes it is a local code not UUID. 

§ is the head of a Sense. If there is no § before a Sense code, it is a link to another Sense code with § before it.