- New
Searching the catalog…
Elements of Computation Theory (Texts in Computer Science)
₹415.00
Overview of Elements of Computation Theory (Texts in Computer Science) Book
| Title | Elements of Computation Theory (Texts in Computer Science) |
| Author | Arindama Singh |
| ISBN-13 | 9781848824966 |
| Publication | SPRINGER |
The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such qu- tions. Their ingenious techniques used in answering these questions form the theory of computation. Theory of computation deals with the most fundamental ideas of computer s- ence in an abstract but easily understood form. The notions and techniques employed are widely spread across various topics and are found in almost every branch of c- puter science. It has thus become more than a necessity to revisit the foundation, learn the techniques, and apply them with con?dence. Overview and Goals This book is about this solid, beautiful, and pervasive foundation of computer s- ence. It introduces the fundamental notions, models, techniques, and results that form the basic paradigms of computing. It gives an introduction to the concepts and mathematics that computer scientists of our day use to model, to argue about, and to predict the behavior of algorithms and computation. The topics chosen here have shown remarkable persistence over the years and are very much in current use.
-
For General Enquiries E-mail support@madrasshoppe.com
-
COD Available. Delivery Time 4 - 7 Working Days in India.
-
Trusted by over 100K+ customers. Verified and Trusted Cashfree Online Payment
Overview of Elements of Computation Theory (Texts in Computer Science) Book
The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such qu- tions. Their ingenious techniques used in answering these questions form the theory of computation. Theory of computation deals with the most fundamental ideas of computer s- ence in an abstract but easily understood form. The notions and techniques employed are widely spread across various topics and are found in almost every branch of c- puter science. It has thus become more than a necessity to revisit the foundation, learn the techniques, and apply them with con?dence. Overview and Goals This book is about this solid, beautiful, and pervasive foundation of computer s- ence. It introduces the fundamental notions, models, techniques, and results that form the basic paradigms of computing. It gives an introduction to the concepts and mathematics that computer scientists of our day use to model, to argue about, and to predict the behavior of algorithms and computation. The topics chosen here have shown remarkable persistence over the years and are very much in current use.
Book Type :
Mathematics
Book Binding :
Not Available
Language :
English
No. of Pages :
422 Pages
ISBN - 10 :
1848824963
ISBN - 13 :
9781848824966
Elements of Computation Theory (Texts in Computer Science) Published On :
8 May 2009
Publisher :
Springer
Edition :
2009th
About Arindama Singh:
Arindama Singh is the author of Elements of Computation Theory (Texts in Computer Science).
Disclaimer:
- Elements of Computation Theory (Texts in Computer Science) book is not for reading online or for free download in PDF or eBook format.
- Table of Contents, Index, Syllabus, summary and image of Elements of Computation Theory (Texts in Computer Science) may be of a different edition or of the same title.
- Price can change due to reprinting, price change by publisher or sourcing cost change for imported books.
Reviews (0)
Overview of Elements of Computation Theory (Texts in Computer Science) Book
| Title | Elements of Computation Theory (Texts in Computer Science) |
| Author | Arindama Singh |
| ISBN-13 | 9781848824966 |
| Publication | SPRINGER |
The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such qu- tions. Their ingenious techniques used in answering these questions form the theory of computation. Theory of computation deals with the most fundamental ideas of computer s- ence in an abstract but easily understood form. The notions and techniques employed are widely spread across various topics and are found in almost every branch of c- puter science. It has thus become more than a necessity to revisit the foundation, learn the techniques, and apply them with con?dence. Overview and Goals This book is about this solid, beautiful, and pervasive foundation of computer s- ence. It introduces the fundamental notions, models, techniques, and results that form the basic paradigms of computing. It gives an introduction to the concepts and mathematics that computer scientists of our day use to model, to argue about, and to predict the behavior of algorithms and computation. The topics chosen here have shown remarkable persistence over the years and are very much in current use.