Maps | General information (large file!) | Details and features | Specifications | Issue areas | Press release
Methodology | Background paper | The cartographic metaphor | Criteria | How the maps work (large file!)
For Instructors and Students | Importance of Turing debate | For instructors | For students | Protagonist index | FAQS
Commentary and Reviews | Commentary and reviews | Errata and corrections
Action Items | Buy the set of maps | How you can participate in this debate
Examples | View the maps. | Map 1 | Map 2 | Map 3 | Map 4 | Map 5 | Map 6 | Map 7 | (large files!)
MacroVU home page | Send us a message | Project Director's Home Page

Through out the five decades of the Can Computers Think? debate, questions about mathematical possiblity, primarily based on the Godel undecidability theorm, have been important areas of debate. For greater detail, click on areas where cursor changes to pointing finger.