Book
Turing Omnibus
Prepare yourself for a wonderfully eclectic journey through the land of Turing, that ripe mathematical landscape fed by imagination and technology. The coach stops at all the must-see landmarks in computer science - monuments of theory, avenues of application, and other points of interest along the way. From artificial intelligence and simulation to computer vision and cryptography, the Turing Omnibus takes you on a fascinating excursion.
დამატებითი ინფორმაცია
- ISBN: 0716782715
- ფიზიკური აღწერილობა: 455 p.
- გამომცემლობა: NY Freeman & Company, W. H. 1993
ხელმისაწვდომი ასლები
- 1 of 1 copy available at შზსუ-ს ბიბლიოთეკები.
დაჯავშნა
- 0 current holds with 1 total copy.
Show Only Available Copies
| მდებარეობა | ინვენტარის ნომერი / ასლის შენიშვნები | შტრიხკოდი | თაროზე განთავსების ადგილი | სტატუსი | დასაბრუნებელია |
|---|---|---|---|---|---|
| მთავარი ბიბლიოთეკა | IBSU 004 D-27 064 | IBSU002302064 | Stacks | Available | - |
| Preface | xi | |
| Icons | xvi | |
| 1. | Algorithms | 1 |
| 2. | Finite Automata | 8 |
| 3. | Systems of Logic | 14 |
| 4. | Simulation | 22 |
| 5. | Gödel's Theorem | 29 |
| 6. | Game Trees | 36 |
| 7. | The Chomsky Hierarchy | 42 |
| 8. | Random Numbers | 49 |
| 9. | Mathematical Research | 56 |
| 10. | Program Correctness | 63 |
| 11. | Search Trees | 69 |
| 12. | Error-Correcting Codes | 77 |
| 13. | Boolean Logic | 82 |
| 14. | Regular Languages | 91 |
| 15. | Time and Space Complexity | 96 |
| 16. | Genetic Algorithms | 103 |
| 17. | The Random Access Machine | 109 |
| 18. | Spline Curves | 116 |
| 19. | Computer Vision | 121 |
| 20. | Karnaugh Maps | 131 |
| 21. | The NewtonâRaphson Method | 139 |
| 22. | Minimum Spanning Trees | 146 |
| 23. | Generative Grammars | 152 |
| 24. | Recursion | 159 |
| 25. | Fast Multiplication | 167 |
| 26. | Nondeterminism | 174 |
| 27. | Perceptrons | 181 |
| 28. | Encoders and Multiplexers | 188 |
| 29. | Cat Scanning | 193 |
| 30. | The Partition Problem | 201 |
| 31. | Turing Machines | 207 |
| 32. | The Fast Fourier Transform | 217 |
| 33. | Analog Computation | 223 |
| 34. | Satisfiability | 231 |
| 35. | Sequential Sorting | 237 |
| 36. | Neural Networks That Learn | 241 |
| 37. | Public Key Cryptography | 250 |
| 38. | Sequential Circuits | 258 |
| 39. | Noncomputable Functions | 265 |
| 40. | Heaps and Merges | 269 |
| 41. | NP-Completeness | 276 |
| 42. | Number Systems for Computing | 282 |
| 43. | Storage by Hashing | 288 |
| 44. | Cellular Automata | 295 |
| 45. | Cook's Theorem | 301 |
| 46. | Self-Replicating Computers | 307 |
| 47. | Storing Images | 315 |
| 48. | The Scram | 321 |
| 49. | Shannon's Theory | 329 |
| 50. | Detecting Primes | 335 |
| 51. | Universal Turing Machines | 339 |
| 52. | Text Compression | 345 |
| 53. | Disk Operating Systems | 351 |
| 54. | NP-Complete Problems | 357 |
| 55. | Iteration and Recursion | 363 |
| 56. | VLSI Computers | 368 |
| 57. | Linear Programming | 374 |
| 58. | Predicate Calculus | 382 |
| 59. | The Halting Problem | 391 |
| 60. | Computer Viruses | 396 |
| 61. | Searching Strings | 403 |
| 62. | Parallel Computing | 408 |
| 63. | The Word Problem | 415 |
| 64. | Logic Programming | 420 |
| 65. | Relational Data Bases | 427 |
| 66. | Church's Thesis | 434 |
| Index | 443 |
