The Science of Computing: Exploring the Nature and Power of AlgorithmsThe Science of Computing presents, in a no-nonsense way, an exposition on algorithms, the topic that is the essence of computer programming. Appropriate for programmers, computer professionals, and the technically minded public. |
Contents
Algorithms and data | 25 |
Programming languages | 51 |
Methods and Analysis | 73 |
Copyright | |
7 other sections not shown
Common terms and phrases
algorithmic problems Alice assertion basic behavior big-O binary CALIFORNIA LIBRARY cards carried Chapter complexity computer science concurrency construct contains correctness counter programs critical section data structures decryption digits dining philosophers problem discussed efficient elements encryption example execution fact Figure finite function halting problem Hamiltonian path hence heuristics infinite instructions intelligence interested intractable involves kind legal inputs linear logical loop lower bound mergesort method models move nodes NP-complete NP-complete problems number of processors output P₁ parallel algorithm philosophers polynomial possible precisely primality probabilistic algorithms programming languages proof protocols prove PSPACE public-key cryptography random reader reasonable recursive semaphore sequence sequential simple simulate solution solvable solve sorting sorting algorithm sorting network subroutine symbols tape terminate things tile Towers of Hanoi traversal tree Turing machine Turing test undecidable UNIVERSITY OF CALIFORNIA variables verify