§

§code is neither like instruction code nor Unicode; it is an infinitely extensible serial ID. Global §ID is issued starting with the birth of the first § in the world, and new global § are constantly being born every time, everywhere. Upon the death of a §, its ID will be permanently invalidated, and no § will ever use that serial ID again.

Sense reactor

There is no more processor

There is a reactor

The reactor I talked about is not the power supply for the processor; it is to replace the processor.

I even had my own Neuron chip replaced by my own Sense reactor. I didn’t “give up halfway”; I was iterated upon by myself.

Biological neurons are  subset

Particle reactions are  global set

Sense

A most basic sense unit is a reference point as entrance on an one-dimensional linear memory array, two directions from this point: one side is value array; the other side is linkage array. Use this particle to organize the Sense graph.

Could the operands, virtual operators, and virtual wires be uniformed to be only one kind of unit?

In the traditional processor, the function is a program counter assignment to jump to the function body and return with the parameters pushed in and popped out the stack.

In the sense graph processor, regard the traditional function declaration and definition as the same type of interreplaceable sentence, use the symbol ≡ to link all interreplaceable sentences, and choose the suitable one according to the configurable situation on site, so the function can be redefined during runtime.

The internal code of the document is the sense list, the internal code of the virtual reality is the sense graph, and the list is a subset of graph, so only one internal code type is needed: sense graph. The presentation of the internal code is the so called pattern, and the so called recognition and synthesis are the transform between the two data types: sense graph and pattern.

La "ŝaltilo = memoro" bazita sistemdezajno tute malsama de la antaŭa dezajno estis en preparado, 

nur atendante por unu tago tia "ŝaltilo = memoro" baza komponento povas esti uzata.

De simulado de la rekta konduto de la cirkvito neefike per la instrukcia kodprogramo de la instrukciaĵaro arkitekturprocesoro ĝis simulado de la partiklo kontaktanta reagon malefike per la integra cirkvito.

Kio estas la Ron-lingvo? Biologia neŭrala informo estas speco de Ron-lingvo, sed Ron-lingvo ne estas limigita al la lingvo de rekta neŭrala informo. Oni povas ankaŭ diri, ke Ron-lingvo ne estas limigita al iu unuopa formo de ondo-informo kiel teksto, simboloj, sono, bildoj... ktp. La Ron-lingvo estas ampleksa padronlingvo.

sen

aŭtoj sen radoj 

aviadiloj sen surteriĝo

uzantinterfaco sen redaktilo

procesoro sen programkalkulilo

早期设计是在开关网络旁摆一块将输入的 sentences 与 senses 匹配解译成开关网络连接状态与将开关网络连接状态及其连接的 senses 编译成 sentences 输出的功能线路仅有一对 ports，后来进阶到内部开关网络动态连接的 senses 之间也相互对彼此收发 sentences 于是就将其合併至开关网络成为匹配开关网络，这么一来，不仅只有一种 port 而且连同 conversation 也和跨芯片开关网络连接端口一样是多 ports。除此之外，原本用于芯片间交互缓存（当 travel 到一个 sense 是 uncached 即透过缓存端口 send 一个自己至自身所记载本尊所在芯片然后彼端传回一串本尊的 subsenses 接到这个 sense 变成 cached）回存（当一个 sense 有增删 subsense 或有更新也就是删掉旧的 subsense 增加新的 subsense 即透过「回存+」或「回存-」端口 send 一个自己后接一串增或删的 subsenses 至其本身记载所有本尊与分身所在芯片去接上为那 sense 的 subsenses 或比对 subsenses 将之删除）的 ports 亦与之合併改成以 sentences 实现 sense graphs 缓存与回存的操作，然而 sentence 是定义结构可弹性扩充的所以还要设法由内部结构而非外部检查的方式避免 injection 破坏基底缓存回存的机制。

非淘汰传统处理器换成图论机不可

匹配开关网络当配置量足夠时即配置成并行、不夠时则配置成串行，弹性变动带宽乃图论机之基本。传统处理器改一下也可以串行处理不固定长短的数据，增加内存模组再外套解码器所增加的位址长度在处理器端固定带宽的定址输出端口可改成串行输出再并分到内存模组位址解码器的输入端口，而定到址的内容也可以位移串行输出至处理器端，所以非淘汰传统处理器换成图论机不可的原因并不是不固定长短数据的定址与运算。当内存模组扩充到某个程度的量后，定址解码器所占空间开始超过匹配开关网络状态内存所占空间，花了那么多空间仅定了一个址相对于开关网络可同时多对多连接当然是划不来了，这才是非淘汰传统处理器换成图论机不可的原因之一。将独立内存模组的定址解码线路改成内容匹配线路，由串行输入位移比对到内容相符的槽起始位移串行输出给处理器所耗的空间就和开关网络的匹配线路一样，但仅一对串行端口就是效能瓶颈，所以非淘汰传统处理器换成图论机不可。

The software of Turing machine is an instruction sequence; the software of the graph machine is a multiple graph. The nodes of the graph distributing on grid chips move with traffic, configurable amount, and performance in real time. There are multiple requests to move in different directions, so do not move the nodes and just cache out their clones.

The travelers in the graph processor

The new graph processor uses the travelers to replace the program counters in the old sequential processor. 

The travelers in the graph machine are not the address registers in the old sequential processor, they are the node markers shifting through the switches network.

Subgraph = class

There are several the same subgraphs in a large graph can be overlapped to be only one in the memory as a class, and then the boundaries between the overlapped subgraph and the large graph holes formed after the subgraphs cutted can be regarded as the instances of this class.

There may also be several the same subgraphs in a subgraph. Travelers remember one more boundary each time crossing a boundary into a subgraph, and forget the last added boundary when exiting a subgraph. Via these remembered boundaries, the travelers from different instances can go back where they came after they leave the class traveling. 

It is possible to have different subgraph within an overlapped graph, in this condition, there are several different boundaries at the same place.

The collection graph in the Sense graph

There is no container class of the traditional object system because the collection graph in the sense graph already has satisfied originally.

New software making way wanted

The traditional way of making software is to write a whole document and hand it over to the compiler to convert to a sequence of instruction codes. 

What we want is to generate and modify the software in frequent interactive conversations during runtime. 

The software is composed of Senses. 

Everything is Sense, all time is runtime.

The ports of the Sense Graph chip

There are two basic interfaces among the Sense Graph chips:

1. sentences stream conversation port 

2. data flow channel ports connecting the switches network across chips 

Compare with the memory address output port and the instruction / data port of the traditional stack processor.

Graph machine & Replacement machine

Graph machine 是模拟人在阅读或算式的过程是先同时看到几个重要关键的字符再系结旁边的字符组成认知图而理解一段文式然后进行思考。

Replacement machine 是模拟人在阅读或算式的过程会逐步将文式片段转换成自己已理解的片段，多次返复代换到最后其实就是结果与答案了。

Graph machine & Replacement machine

Graph machine 基本是依结合优先顺序透过 comparation gate array 同时并行位移比对将 match 到多个 Sense 中取左边第一个连接到动态配置的 virtual wire 上，之后 sense 欲变更 virtual wire 的连接状态亦是相同的方式输出 senses 到 comparation gate array 上。

Replacement machine 基本透过 comparation gate array 与 replacement table 做同时并行位移比对将 match 到的片段 replace，返复进行至没有任何 match 了即为运算完成。排在 table 前面的优先 replace 即达 graph machine 中结合力较强的 operator 优先结合的效果，过程中遇到 definition keyword 就将片段加入 table 或从其刪除。

两者对括号的处理方式都是在比对到左括号时都暂不 connect 或 replace ，后面再一并进行消括号的动作，自多个左括号处同时并行向右位移比对出右括号，左右括号间仅存在一 Sense 即消掉左右括号，接着再重复前面的动作 loop 至不再比对出任何括号，若自左括号处向右位移比对到左括号则什么都不做、等待下一 loop 后面再重复进行一次。

Graph machine 是接线生的角色，接完线后 graph 自己是线路、自己在动；Replacement machine 的 senses 则完全是被动处理，纯粹是 data。

Can these two machines be combined to be one machine?