The AED approach to generalized computer-aided design
ACM '67 Proceedings of the 1967 22nd national conference
Algol-60 Implementation
LISP 1.5 Programmer's Manual
Associative logic for highly parallel systems
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Language directed computer design
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
MP/C: A Multiprocessor/Computer Architecture
IEEE Transactions on Computers
Traversing Binary Tree Structures with Shift-Register Memories
IEEE Transactions on Computers
| Hi-index | 14.99 |
The expenditure of resources to provide via software more structure and more function in conventional machines has become excessive. The answer to this problem may consist in providing more structure and more function in hardware. With respect to structure, we describe 1) the binary tree as basic data and control structure, 2) the implementation of a binary tree by a conventional memory, and 3) the associated hardware. The most important enhancement with respect to function, the newly introduced unit of action, deals with the handling of variables and substitution.