This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
- ISBN:
- 9780521302456
- 9780521302456
-
Category:
- Mathematical theory of computation
- Format:
- Hardback
- Publication Date:
-
23-05-1985
- Language:
- English
- Publisher:
- Cambridge University Press
- Country of origin:
- United Kingdom
- Pages:
- 300
- Dimensions (mm):
- 234x162x22mm
- Weight:
- 0.57kg
Click 'Notify Me' to get an email alert when this item becomes available
Hi There,
Did you know that you can save books into your library to create gift lists, reading lists, etc?
You can also mark books that you're reading, or want to read.
Great!
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Reviews
Be the first to review Computation and Automata.
Share This Book: