Computer Science I / Limits and Continuity
Practice question · Multiple choice

Calculus assumes exact real numbers and computers have neither exact reals nor infinitely many of them. Why is numerical computing nevertheless trustworthy?

Hints
  1. Ask what a numerical analyst computes alongside the answer.
  2. The goal is not exactness. What is it?
Show the answer

A. Because methods come with error analysis, so you get a bound

Why

The discipline is bounding the error rather than pretending it away: truncation from stopping an infinite process, round-off from the arithmetic, both quantified. Option 2 is comforting and false, errors compound in some algorithms and cancel in others, which is exactly what stability analysis is for.

Read the lesson: Limits and Continuity →

Practise Limits and Continuity

The app has 6 more questions on this lesson, and keeps your place in the course. Computer Science I is free to start.

More questions on Limits and Continuity