Abstract
Computation performed by a Turing machine with time complexity t(n) can be thought of as being performed by a t(n)×t(n) table consisting of t(n)×t(n) cells. The ith row of the table transforms a configuration of the Turing machine at the ith step into the configuration at the next step. Each cell of the table can be regarded as a generalized gate that can be implemented by a certain number of Boolean gates under a suitable encoding. This circuit model which works as a counterpart to a Turing machine illustrates more directly how each configuration is transformed into the next configuration. By introducing this alternative circuit model, we can better understand the notion of nondeterminism discussed in Chap. 6 as well as the notion of NP-completeness which will be discussed in Chap. 10.
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 subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Maruoka, A. (2011). Computational Complexity Based on Boolean Circuits. In: Concise Guide to Computation Theory. Springer, London. https://doi.org/10.1007/978-0-85729-535-4_9
Download citation
DOI: https://doi.org/10.1007/978-0-85729-535-4_9
Publisher Name: Springer, London
Print ISBN: 978-0-85729-534-7
Online ISBN: 978-0-85729-535-4
eBook Packages: Computer ScienceComputer Science (R0)