## An associative and impressible computer |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

1..MemorySize Action FLM Algol 60 algorithm Andreae artificial intelligence automata BEGIN INTEGER behaviour best match binary binary tree buffer trace calculation cascade of length cell Chapter chosen Cleary CLEARY University condition Consider Cyc(S deleted disc Dual-FLM echo actions equations Euclidean distance Euclidean space evaluation event tree example execution EXIT Felix finite automaton FLM computer FLM memory free list given Hamming distance hash address hash key implemented insert kXXR language lower bound Main FLM memory locations Mew-PUSS MFLM NextSymbol node number of bits number of traces obtained occur particular partition pattern pointer possible Pred(S PROCEDURE production system program mode PURR-PUSS random result retrieval routine run mode scan semi-reflexive sequence of events shown shows simple simulate any finite single FLM specified stored string subroutine subset sufficient symbol tail techniques Theorem ToBeDeleted total number transition tree structure update