A Tough nut for Proof Procedures. AIM-016
Abstract/Contents
- Abstract
- It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures.
Description
| Type of resource | text |
|---|---|
| Form | memorandums |
| Extent | 1 text file |
| Place | Stanford (Calif.) |
| Date created | July 1964 |
| Language | English |
| Digital origin | reformatted digital |
Creators/Contributors
| Author | McCarthy, John, 1927-2011 |
|---|
Subjects
| Subject | Stanford Artificial Intelligence Laboratory |
|---|---|
| Subject | Memo (Stanford Artificial Intelligence Laboratory) |
| Subject | Artificial intelligence |
| Genre | Memorandums |
Bibliographic information
| Finding Aid | |
|---|---|
| Memo | AIM-016 |
| Location | https://purl.stanford.edu/wq548tg4794 |
| Location | SC1041 |
| Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
- Copyright
- Copyright © The Board of Trustees of the Leland Stanford Junior University. All rights reserved.
Collection
Stanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...