Opening book details…
Can I read Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) on EtoBox?
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) by Martin D. Davis; Ron Sigal; Elaine J. Weyuker is a nonfiction available to read on EtoBox.
What is Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) about?
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.<br><br>* Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.<br>* The number of exercises included has more than tripled.<br>* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.
Who reads Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Martin D. Davis; Ron Sigal; Elaine J. Weyuker
- Publisher
- Morgan Kaufmann Publishers
- Published
- 1994
- Language
- EN
- ISBN
- 9780080502465
- Category
- nonfiction
- Subjects
- Language Learning, Mathematics, Computer Science
Other editions & translations
- Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (1994)
- Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (2003)
- Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Second Edition (1994)
More by Martin D. Davis; Ron Sigal; Elaine J. Weyuker
Browse all works by Martin D. Davis; Ron Sigal; Elaine J. Weyuker
Similar books
- Computability and Complexity Theory (Texts in Computer Science) — Alan L. Selman Steven Homer (2001)
- Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) — Richard Lassaigne, Michel de Rougemont (auth.) (2004)
- Complexity Theory Of Real Functions (progress In Theoretical Computer Science) — Ker-I Ko; Birkhäuser Verlag (2012)
- A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science) — Alan P. Parkes; Dexter C. Kozen; Chris Hankin; Flemming Nielson; Samson Abramsky; David D. Zhang; Ian Mackie; Iain Stewart; Steven S. Skiena (2008)
- Models of Computation: An Introduction to Computability Theory (Undergraduate Topics in Computer Science) — Maribel Fernández; Samson Abramsky; Chris Hankin (2009)
- Computability, Complexity, Logic (Volume 128) (Studies in Logic and the Foundations of Mathematics, Volume 128) — E. Börger (1989)