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

Class 42: Costs of Computing

Back to Models of Computation. On to The Limits of Computing.

Held Tuesday, April 18, 2000


Today we continue our discussion of models of computation by considering issues of nondeterminism.

Question 42 for discussion today: What implications do you see in the existence of NP-complete problems?

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





Today, we continure our somewhat different approach to the technical material. Once again, it's up to you as a class to figure out what's going on in these chapters. We'll continue this strategy for the rest of the week.

Some basic questions to get you started:



Saturday, 22 January 2000

Tuesday, 18 April 2000

Back to Models of Computation. On to The Limits of Computing.

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

Source text last modified Tue Apr 18 08:32:55 2000.

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

Contact our webmaster at