Abstract
Ashok Chandra is a famous theorist who has done seminal work in the many parts of the foundations of complexity theory. His early work was in program schemas, an area that was central to theory in the 1970’s. Chandra then moved into other areas of theory, and among other great things co-invented the notion of Turing Machine Alternation—see Chp. 12.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-1-4419-7155-5_45
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lipton, R.J. (2010). Protocols. In: The P=NP Question and Gödel’s Lost Letter. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7155-5_38
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7155-5_38
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-7154-8
Online ISBN: 978-1-4419-7155-5
eBook Packages: Computer ScienceComputer Science (R0)