[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Risks] [Examples]

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

**Held** Tuesday, April 18, 2000

**Overview**

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?*

**Notes**

- For tomorrow, read Dewdney 26 (Nondeterminism) and 54 (NP-Complete Problems)
- Upcoming events:
- Thursday night's Africana studies conference
- Cool talk on bias in standardized testing Thursday at 4:30.

**Contents**

**Summary**

- Turing machines, revisited
- Nondeterminism
- NP-completeness

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.

- Moderator: Cathy
- Recorder: Jae

Some basic questions to get you started:

- What makes one model of computation ``more powerful'' than another? [Thanks Jae]
- What is a Turing machine?
- What is nondeterminism?
- Does nondeterminism add power? Why or why not?
- What is an NP-complete problem?

Tomorrow:

- Moderator: Adan
- Recorder: Jeana

Saturday, 22 January 2000

- Created as a blank outline.

Tuesday, 18 April 2000

- Filled in the details.

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

[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Quizzes] [Questions] [Risks] [Examples]

**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.42.html

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 rebelsky@grinnell.edu