The Graph Machine

The traditional computer mechanism is that a central processing unit processes documents in a memory module just like a person is reading and writing a document; the graph machine is that the words in the documents in the memory module are contacting to react with each other automatically by themselves via the switches network, and there is no such one processing the document. Verbs, conjunctions, and prepositions are operators; nouns, adjectives, adverbs, articles, and quantifiers are operands. Just be like the contact reaction of particles. 

Operators (arithmetic logic units) and links (wires) in the application specific integrated circuit are like fixed houses and roads in the city; blocks and virtual wires in the field programmable gate array are like fixed houses and variable roads; what would it be called if virtual operators and virtual links inside are like variable houses and roads?

In fact, the arithmetic logic unit before cost down is equivalent to a memory module, which is removed the redundant gates for fixed purposes. However, fixedly placed arithmetic logic units will cause virtual wires consuming more time and space than the original memory module, so it is better to use the replaceable virtual operators to replace the fixed ones.

Of course, the best is that the switch gatecon itself is a non-volatile memory.

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.