A MACHINE FOR SOLVING LOGIC PROBLEMS OF THE RELAY-NETWORK SYNTHESIS TYPE,
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Pagination or Media Count:
A machine concept for switching problems has been developed at the Tomsk University which consists of a general-purpose computer plus an L-machine, which allows the former to carry out additional operations important in Boolean minimization problems. Three types of L-machine operations are distinguished 1 The mu-operation which is equivalent to a two-position operation on a 10-argument Boolean function 2 The nu-operation which is an information exchange between the principal field A and the digital-computer storage it also covers some more complex A-field operations 3 The lambda-operation which is realized according to a subroutine taken from the computer storage and expressed in the language of U-, mu-, or nu-operation. Examples of the above operations are illustrated graphically. Simulation of the L-system on a general-purpose computer corroborated the L-system advantages which are claimed to be simple programming and quicker solutions.
- Electrical and Electronic Equipment