Artificial Intelligence and Mathematical Theory of Computation
Papers in Honor of John McCarthy
Published on 31. December 1991
Book
Hardback
504 pages
978-0-12-450010-5 (ISBN)
Description
A book intended for researchers in computer science, in particular, artificial intelligence, theoretical computing, and programming languages. This volume honours John Mccarthy for his fundamental contributions to the field of computer science. The papers, written by leading computer science researchers, range from historical overviews to technical reports on the key areas of computer science in which McCarthy has worked - LSP, programming languages, symbolic computation, mathematical theory of computation, and artificial intelligence.
More details
Language
English
Place of publication
San Diego
United States
Publishing group
Elsevier Science Publishing Co Inc
Target group
Professional and scholarly
Illustrations
index
Dimensions
Height: 230 mm
Weight
822 gr
ISBN-13
978-0-12-450010-5 (9780124500105)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Vladimir Lifschitz
Artificial and Mathematical Theory of Computation
Papers in Honor of John McCarthy
E-Book
12/2012
Academic Press
€54.95
Available for download
Content
A short sketch of the life and career of John McCarthy, D. Israel; functional instantiation in first order logic, R. Boyer et al; lambada - the ultimate combinator, R. Cartwright; termination proofs and the "91" function, S. Feferman; robots with common sense?, J. Feldman; ascribing artificial intelligence to (simpler) machines, or when AI meets the world, R. Filman; the design of parallel programming languages, R. Gabriel; metaprogramming at work in automated manufacturing, C. Goad; LISP + calculus = identities, W. Gosper; model checking vs theorem proving - a manifesto, J. Halpern and M. Vardi; algebraic computation - the quiet revolution, A. Hearn; lisp and parallelism, T. Ito; an application of amalgamated logic to multi-agent belief, J. Kim and R. Kowalski; text-book examples of recursion, D. Knuth; belief and introspection, H. Levesque; monotonicity properties in automated deduction, Z. Manna, et al; circumscription and disjunctive logic programming, J. Minkler, et al; on the equivalence of data representations, J. Mitchell; caution! robot vehicle!, H. Moravec; circumscription and authority, P. Rathman and G. Wiederhold; the frame problem in the situation calculus - a simple solution to the frame problem (sometimes) and a completeness result for goal regression, R. Reiter; abstraction mechanism for symbolic expressions, M. Sato; varieties of context, Y. Shoham; the inventor and his object - the programming language LISP, H. Stoyan; binding structures - abstract syntax generalized to binding and binding contexts, C. Talcott; logicism in AI and common sense in philosophy - John McCarthy's programme in philosophical perspective, R. Thomason; the incorrectness of the bisection algorithm, R. Weyhrauch.