Computers Ltd What They Really Can't Do

by
Format: Hardcover
Pub. Date: 2000-12-14
Publisher(s): Oxford University Press
  • Free Shipping Icon

    This Item Qualifies for Free Shipping!*

    *Excludes marketplace orders.

List Price: $28.88

Rent Book

Select for Price
There was a problem. Please try again later.

New Book

We're Sorry
Sold Out

Used Book

We're Sorry
Sold Out

eBook

We're Sorry
Not Available

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

The computer has been hailed as the greatest innovation of the 20th century, and there is no denying that these technological marvels have dramatically changed our everyday lives. They can fly airplanes and spaceships, route millions of phone calls simultaneously, and play chess with the world's greatest players. But how limitless is the future for the computer? Will computers one day be truly intelligent, make medical diagnoses, run companies, compose music, and fall in love? In Computers Ltd., David Harel, the best-selling author of Algorithmics, illuminates one of the most fundamental yet under-reported facets of computers--their inherent limitations. Looking only at the bad news that is proven, discussing limitations that no amounts of hardware, software, talent, or resources can overcome, the book presents a disturbing and provocative view of computing at the start of the 21st century. Harel takes us on a fascinating tour that touches on everything from tiling problems and monkey puzzles to Monte Carlo algorithms and quantum computing, showing just how far from perfect computers are, while shattering some of the many claims made for these machines. He concludes that though we may strive for bigger and better things in computing, we need to be realistic: computers are not omnipotent--far from it. Their limits are real and here to stay. Based on hard facts, mathematically proven and indisputable, Computers Ltd. offers a vividly written and often amusing look at the shape of the future.

Author Biography


David Harel is William Sussman Professor of Mathematics at The Weizmann Institute of Science, in Israel. One of the world's leading computer scientists, he is the author of the critically acclaimed Algorithmics, which has sold more than 100,000 copies worldwide.

Table of Contents

what's it all about?
1(27)
Algorithms
2(3)
Basic instructions
5(2)
The text vs. the process
7(2)
Inputs
9(1)
What do algorithms solve?
10(5)
Isn't our setup too simplistic?
15(1)
Solving algorithmic problems
16(2)
Programming
18(3)
Errors and correctness
21(5)
Termination
26(1)
sometimes we can't do it
27(32)
Finite problems are solvable
29(1)
The tiling problem
30(3)
Do we really mean it?
33(3)
Elementary computing devices
36(4)
The Church-Turing thesis
40(2)
Computability is robust
42(4)
Domino snakes
46(2)
Program verification
48(2)
The halting problem
50(3)
Nothing about computation can be computed!
53(1)
Some problems are even worse
54(5)
sometimes we can't afford to do it
59(32)
Resources: time and memory space
60(1)
Improving running time
61(4)
Upper and lower bounds
65(4)
So what?
69(1)
The towers of Hanoi
69(4)
The good, the bad, and the ugly
73(5)
Intractability
78(4)
Roadblocks and chess
82(3)
Problems that are even harder
85(3)
Unreasonable memory requirements
88(3)
Sometimes we just don't know
91(28)
The monkey puzzle
92(3)
NP-complete problems
95(2)
Finding short paths
97(3)
Scheduling and matching
100(2)
More on puzzles
102(2)
Coloring networks
104(2)
Magic coins
106(3)
Standing or falling together
109(2)
The great mystery: is P equal to NP?
111(2)
Can we come close?
113(2)
Sometimes we succeed
115(4)
Trying to ease the pain
119(38)
Parallelism, or joining forces
121(3)
Can parallelism eliminate the bad news?
124(5)
Randomization, or tossing coins
129(3)
More on Monte Carlo algorithms
132(2)
Testing for primality
134(2)
Randomized primality testing
136(4)
Can randomization eliminate the bad news?
140(1)
Can computers simulate true randomness?
141(2)
Quantum computing
143(3)
Quantum algorithms
146(5)
Can there be aquantum computer?
151(2)
Molecular computing
153(4)
Turning bad into good
157(32)
Classical cryptography
158(3)
Public-key cryptography
161(4)
Signing messages
165(3)
Can this be made to work?
168(2)
The RSA cryptosystem
170(3)
Interactive proofs
173(4)
Zero-knowledge proofs
177(3)
I can 3-color a network
180(6)
On millionaires, ballots, and more
186(3)
Can we ourselves do any better?
189(24)
Algorithmic intelligence?
191(1)
The Turning test
192(4)
ELIZA and zupchoks
196(3)
Heuristics
199(5)
What is knowledge?
204(4)
Understanding natural language
208(5)
Postramble 213(2)
Index 215

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.