Search NKS | Online
11 - 20 of 24 for Nor
Nor is it clear how it relates to the fact that the number of items that can be stored in short-term memory seems steadily to increase.
2D class 4 cellular automata
No 5- or 9-neighbor totalistic rules nor 5-neighbor outer totalistic ones appear to yield class 4 behavior with a white background.
But in a sense the greatest complexity lies between these extremes—in systems that neither stabilize completely, nor exhibit close to uniform randomness forever.
And the behavior obtained never seems to repeat, nor do the networks produced exhibit any kind of obvious nested form.
But whenever there is neither just a single active data element nor an obvious sequence of independent execution steps—as for many of the programs in this book—my experience has always been that the only viable choice of interface is a computer language like Mathematica, based essentially on one-dimensional sequences of word-like constructs.
Nand and Nor are mostly used only in circuit design and in a few foundational studies of logic.
Nor will there probably be any immediate trace of even such basic phenomena as motion.
If no self connections are allowed then these numbers become {1, 2, 6, 20, 91} , while if neither self nor multiple connections are allowed (yielding what are often referred to as cubic or 3-regular graphs), the numbers become {0, 1, 2, 5, 19, 85, 509, 4060, 41301, 510489} , or asymptotically (6 n)!
Class 4 systems are then in the middle: for the activity that they show neither dies out completely, as in class 2, nor remains at the high level seen in class 3.
And in looking at this picture, we see a remarkable phenomenon: there is neither a systematic trend towards increasing randomness, nor any form of simple predictable behavior.