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}
}
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

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

The effects of logic delay on computation rate, delay, which representation will operate at the rate of Ph.D

  • Loomis, H. H.
  • 1963

Some universal elements for finite automata , feedback of sets of delayed - logic devices

  • M. L. Minsky

Tryon ' s delay operator and the design of synchronous digital circuits , Informal Memo Delayed logic and finite - stage machines

  • F. Hohn

Similar Papers

Loading similar papers…