Abstract
This chapter deals with the synthesis of basic logical functions and simple digital systems by means of unorganized machines. A digital system normally uses a building block approach: many small operational units are interconnected to make up the overall system. Logical functions (gates) like conjunction (AND), disjunction (OR), and negation (NOT) form the basis of every logical and digital system. As we have already seen in Section 2.3.6, all logical functions can be implemented with a network of units that compute NAND functions. We say that NAND gates form a logical basis.
Computers are composed of nothing more than logic gates stretched out to the horizon in a vast numerical system. — Stan Augarten, State of the Art: A Photographic History of the Integrated Circuit, 1983.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Teuscher, C. (2002). Synthesis of Logical Functions and Digital Systems with Turing Networks. In: Turing’s Connectionism. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0161-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0161-1_3
Publisher Name: Springer, London
Print ISBN: 978-1-85233-475-8
Online ISBN: 978-1-4471-0161-1
eBook Packages: Springer Book Archive