![]()
Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou.
|
Location | Call Number | Status | Consortium Loan |
---|---|---|---|
George Washington | |||
Gelman stacks
|
QA 267 .L49 (show me on map) | Available | Request |
WRLC Shared Collections Facility
|
QA 267 .L49 (show me on map) |
Off-site
|
Request |
American | |||
LIB stacks
|
QA267 .L49 | Available | Request |
Gallaudet | |||
UNIV General stacks
|
511 L4e, 1981 | Available | Request |
George Mason | |||
Fenwick stacks
|
QA267 .L49 | Available | Request |
Georgetown | |||
Science stacks
|
QA267 .L49 | Available | Request |
Howard | |||
Founders Library stacks
|
QA267 L49 | Available | Request |
Other Authors |
Papadimitriou, Christos H.,
|
Subjects |
Automatentheorie.
Automates mathématiques, Théorie des. Complexité de calcul (Informatique) Complexité de calcul (informatique) Computational complexity. Fonctions calculables. Formal languages. Informatica. Langages formels. Logic, Symbolic and mathematical. Logique symbolique et mathématique. Machine theory. automate fini. calcul prédicat. calcul propositionnel. complexité calcul. langage algébrique. langage formel. logique mathématique. logique symbolique. machine Turing. thèse Church. théorie calcul. |
Series |
Prentice-Hall software series.
|
Description |
xiv, 466 pages : illustrations ; 24 cm.
|
Copyright Date |
[1981]
©1981 |
Notes |
Includes bibliographical references and index.
Also issued online. |
Contents |
Sets, relations, and languages -- Finite automata -- Context-free languages -- Turing machines -- Church's thesis -- Uncomputability -- Computational complexity -- The propositional calculus -- The predicate calculus.
|
Network Numbers |
(OCoLC)6707094
(OCoLC)ocm06707094 |
WorldCat | Search OCLC WorldCat |
WorldCat Identities | Lewis, Harry R.
Publication timeline, list of works, related names and subjects and other information |
Services
Export citation to: RefWorks