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


Class 31: The Costs of Reliability

Back to Proving Programs Correct. On to PacMan, Revisited.

Held Wednesday, March 15, 2000

Overview

Today we conclude our discussions of reliability by visiting topics that seem to be of particular interest.

Question 31 for today's class: How do we balance the need for formal specifications required by program proof techniques and the complexity of modern graphical applications?

Question 32 for Monday's class: What feature do you most want to see in our PacMan game? Sketch a strategy we might use to implement that feature.

Notes

Contents

Summary


This discussion digressed into issues of AI, which we will return to after break.


History

Saturday, 22 January 2000

Wednesday, 15 March 2000

Monday, 3 April 2000

Back to Proving Programs Correct. On to PacMan, Revisited.


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.31.html

Source text last modified Mon Apr 3 09:39:48 2000.

This page generated on Mon Apr 3 09:53:20 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu