Highly Influenced

# Completeness of Sets of Delayed-Logic Devices

@article{Loomis1965CompletenessOS, title={Completeness of Sets of Delayed-Logic Devices}, author={Herschel H. Loomis}, journal={IEEE Trans. Electronic Computers}, year={1965}, volume={14}, pages={157-172} }

- Published in IEEE Trans. Electronic Computers 1965
DOI:10.1109/PGEC.1965.263960

This paper concerns a property of sets of delayedhave as their inputs a multiplicity of binary sequences. logic devices. This property, called completeness, characterizes sets Our notation for a binary sequence is as follows: of logic devices that can be used for the construction of networks to x(t) represents the tth member of the sequence, where represent any finite-state machine. Associated with this property is a rate of completeness, which is the maximum input sequence rate for t is in… CONTINUE READING