## Artificial and Mathematical Theory of Computation: Papers in Honor of John McCarthyArtificial and Mathematical Theory of Computation is a collection of papers that discusses the technical, historical, and philosophical problems related to artificial intelligence and the mathematical theory of computation. Papers cover the logical approach to artificial intelligence; knowledge representation and common sense reasoning; automated deduction; logic programming; nonmonotonic reasoning and circumscription. One paper suggests that the design of parallel programming languages will invariably become more sophisticated as human skill in programming and software developments improves to attain faster running programs. An example of metaprogramming to systems concerns the design and control of operations of factory devices, such as robots and numerically controlled machine tools. Metaprogramming involves two design aspects: that of the activity of a single device and that of the interaction with other devices. One paper cites the application of artificial intelligence pertaining to the project "proof checker for first-order logic" at the Stanford Artificial Intelligence Laboratory. Another paper explains why the bisection algorithm widely used in computer science does not work. This book can prove valuable to engineers and researchers of electrical, computer, and mechanical engineering, as well as, for computer programmers and designers of industrial processes. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

27 | |

Chapter 4 Proofs of Termination and the 91 Function
| 47 |

Chapter 6 Robots with Common Sense?
| 65 |

Chapter 7 Ascribing Artificial Intelligence to Simpler Machines or When AI Meets the Real World | 73 |

Chapter 8 The Design of Parallel Programming Languages | 91 |

Chapter 9 Metaprogramming at Work in Automated Manufacturing
| 109 |

Chapter 10LISP + Calculus Identities
| 129 |

A Manifesto
| 151 |

Chapter 18 Circumscription and Disjunctive Logic Programming | 281 |

Chapter 19 On the Equivalence of Data Representations | 305 |

Chapter 20 Caution Robot Vehicle
| 331 |

Chapter 21 Circumscription and Authority
| 345 |

A Simple Solution Sometimes and a Completeness Result for Goal Regression
| 359 |

Chapter 23 An Abstraction Mechanism for Symbolic Expressions
| 381 |

Chapter 24 Varieties of Context
| 393 |

Chapter 25 The Influence of the Designeron the DesignJ McCarthyand LISP
| 409 |

The Quiet Revolution
| 177 |

Chapter 13 LISP and Parallelism
| 187 |

Chapter 14 Textbook Examples of Recursion | 207 |

Chapter 15 A Metalogic Programming Approach to MultiAgent Knowledge and Belief
| 231 |

Chapter 16 Belief and Introspection
| 247 |

Chapter 17 Monotonicity Properties in Automated Deduction
| 261 |

Chapter 26 Binding Structures
| 427 |

John McCarthysProgram in Philosophical Perspective | 449 |

467 | |

469 | |

### Common terms and phrases

A-expressions abstract abstype algorithm application approach arguments arity Artiﬁcial Intelligence assumption atom believe binding trees bound variables calculus call/cc circumscription clause Computer Science CONSTRAIN constructs context deﬁned deﬁnition denotes devices difﬁcult disjunctive logic program domain efﬁcient environment equations equivalence example expression ﬁeld ﬁnd ﬁnite ﬁrst ﬁrst-order ﬁxed formal formula frame axioms frame problem free variables function symbols functional instantiation given homomorphism identiﬁers implementation indeﬁnite induction inﬁnite interpretation John McCarthy knowledge Kripke structure lambda Lemma mathematical McCarthy’s metaprogramming minimal modal logic MultiLISP natural numbers node nonmonotonic notation NQTHM object operations PaiLISP PaiObject parallel LISP paramodulation predicate symbol problem Proc programming language proof properties propositional prove reasoning recursion relation robot samefringe satisﬁes semantics sentence signature situation calculus speciﬁc Stanford stratiﬁed disjunctive successor state axiom term theorem theory tion University values white3 xform