Lesson plan
Real computation
of an analog computing element to integrate a given function. Real computation theory investigates properties of such devices under the idealizing assumption of infinite precision. In computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible to prove interesting statements such as "The complement of the Mandelbrot set is only partially decidable." These hypothetical computing machines can be viewed as idealised analog computers which operate on real numbers, whereas digital computers are limited to computable numbers. They may be further subdivided into differential and algebraic models (digital computers, in this context, should be thought of as topological, at least insofar as their operation on computable reals is concerned ). Depending on the model chosen, this may enable real computers to solve problems that are inextricable on digital computers, or vice versa. For example, Hava Siegelmann's neural nets can have noncomputable real weights, making them able to compute nonrecursive languages. Claude Shannon's idealized analog computer can only solve algebraic differential equations, while a digital computer can solve some transcendental equations as well.…
Article summary
of an analog computing element to integrate a given function. Real computation theory investigates properties of such devices under the idealizing assumption of infinite precision. In computability theory, the theory of real computation deals with hypothetical computing machines using infinite-precision real numbers. They are given this name because they operate on the set of real numbers. Within this theory, it is possible to prove interesting statements such as "The complement of the Mandelbrot set is only partially decidable." These hypothetical computing machines can be viewed as idealised analog computers which operate on real numbers, whereas digital computers are limited to computable numbers. They may be further subdivided into differential and algebraic models (digital computers, in this context, should be thought of as topological, at least insofar as their operation on computable reals is concerned ). Depending on the model chosen, this may enable real computers to solve problems that are inextricable on digital computers, or vice versa. For example, Hava Siegelmann's neural nets can have noncomputable real weights, making them able to compute nonrecursive languages. Claude Shannon's idealized analog computer can only solve algebraic differential equations, while a digital computer can solve some transcendental equations as well.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.