Number-Crunching : : Taming Unruly Computational Problems from Mathematical Physics to Science Fiction / / Paul J. Nahin.
How do technicians repair broken communications cables at the bottom of the ocean without actually seeing them? What's the likelihood of plucking a needle out of a haystack the size of the Earth? And is it possible to use computers to create a universal library of everything ever written or eve...
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2011] ©2011 |
| Year of Publication: | 2011 |
| Edition: | Course Book |
| Language: | English |
| Online Access: | |
| Physical Description: | 1 online resource (408 p.) :; 4 halftones. 98 line illus. 6 tables. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Frontmatter
- Contents
- Introduction
- 1. Feynman Meets Fermat
- 2. Just for Fun: Two Quick Number-Crunching Problems
- 3. Computers and Mathematical Physics
- 4. The Astonishing Problem of the Hanging Masses
- 5. The Three-Body Problem and Computers
- 6. Electrical Circuit Analysis and Computers
- 7. The Leapfrog Problem
- 8. Science Fiction: When Computers Become Like Us
- 9. A Cautionary Epilogue
- Appendix
- Solutions to the Challenge Problems
- Acknowledgments
- Index
- Also By Paul J. Nahin