An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 43: The Limits of Computing

Back to Costs of Computing. On to Planning for the Rest of the Semester.

Held Wednesday, April 19, 2000

Overview

Today we consider an important limit of computing: are there things that can't be computed?

Question 43 for discussion today: What metaphors might you use for the halting problem? How might those metaphors help one understand the problem?

Question 44 for discussion Friday: What chapters/topics do you plan to present? When? Please list alternatives.

Notes

Contents

Summary


Are there uncomputable problems?

The Halting Problem


History

Saturday, 22 January 2000

Wednesday, 19 April 2000

Back to Costs of Computing. On to Planning for the Rest of the Semester.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.43.html

Source text last modified Wed Apr 19 09:56:14 2000.

This page generated on Wed Apr 19 09:58:43 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu