Sunday, October 21, 2018

My memory attachment is as usual

Nested block,m the top of each sequence holds an offset to the end of sequence, and the end point of an open sequence is null, and null maintains a pointer basic to top of sequence. So, intelligent traversal of the graph is simple increment or add (Step or Skip) to get to the next node. The memory attachment designed for high speed matching,. It is the part of the machine we want in the AI chip.

The work flow become:
A join B -> MEM 
MEM join C ->MEM 
MEM . CONSOLE -> CONSOLE 

Unlike normal programming,  each of the above lines define a slot in their instance list, each instance  a triplet.  They can execute independently in any order, or dependently using the pause request.  

Combinations of the above with intelligent handlers at the match key function driving the skips and steps.  Anywhere in the chain one could introduce the modifier function., and loop.   Any of the input may have asynchronous arrivals, using pause, or not/.

Memory preserved, it can do input and output simultaneously, the Null rulekeeps the one from over taking.  All sequences in in a valid null, which returns a Done to the join.  Attachment can then handle a pause request and let a dependent run.  Only the attachment knows that this is only temporary, needs o distinguish the true Done..

The Intelligent Message Router

The device takes an arbitrary stream of test messages, using high speed, multi level word
 list matching, it can route the unexpected message to the proper department in a company.  The company managers always up to date on the latest. Make the NSA's day with one of these text analyzers.

No comments: