Description |
xviii, 513 pages : illustrations ; 24 cm |
Contents |
1. Introduction and historical review, or, what's it all about? -- 2. Algorithms and data, or, getting it done -- 3. Programming languages and paradigms, or, getting it done by computer -- 4. Algorithmic methods, or, getting it done methodically -- 5. The correctness of algorithms, or, getting it done right -- 6. The efficiency of algorithms, or, getting it done cheaply -- 7. Inefficiency and intractability, or, you can't always get it done cheaply -- 8. Noncomputability and undecidability, or, sometimes you can't get it done at all! -- 9. Algorithmic universality and its robustness, or, the simplest machines that get it done -- 10. Parallelism, concurrency, and alternative models, or getting lots of stuff done at once -- 11. Probabilistic algorithms, or, getting it done by tossing coins -- 12. Cryptography and reliable interaction, or, getting it done in secret -- 13. Software engineering, or, getting it done when it's large |
|
14. Reactive systems, or, getting it to behave properly over time -- 15. Algorithmics and intelligence, or, are they better at it than us? |
Summary |
"This book tells the story of the concepts, ideas, methods and results fundamental to computer science, in a form independent of the details of specific computers, languages and formalisms. It concerns the true 'spirit' of computers; with the 'recipes' that make them tick - their algorithms."--BOOK JACKET |
Notes |
Formerly CIP. Uk |
Bibliography |
Includes bibliographical references (pages [433]-493) and index |
Subject |
Computer algorithms.
|
Author |
Feldman, Yishai A., 1958-
|
LC no. |
2004041063 |
ISBN |
0321117840 paperback |
|