A Tough nut for Proof Procedures. AIM-016
- Title:
- A Tough nut for Proof Procedures. AIM-016
- Author:
- McCarthy, John, 1927-2011
- Author (no Collectors):
- McCarthy, John, 1927-2011
- Collector:
- McCarthy, John, 1927-2011
- Description:
- 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.
- Topic:
- Artificial intelligence
- Subject:
- Stanford Artificial Intelligence Laboratory and Memo (Stanford Artificial Intelligence Laboratory)
- Language:
- English
- Physical Description:
- 1 text file
- Publication Info:
- Stanford (Calif.) and cau
- Date:
- July 1964
- Place created:
- Stanford (Calif.)
- Imprint:
- Stanford (Calif.), July 1964
- Genre:
- memorandums
- Identifier:
- AIM-016
- Repository:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Collection:
- Stanford Artificial Intelligence Laboratory records, 1963-2009
- Manuscript number:
- SC1041