This highly accessible introduction to Lisp is suitable both for novices approaching their first programming language and experienced programmers interested in exploring a key tool for artificial intelligence research. The text offers clear, reader-friendly explanations of such essential concepts as ... read more
Customers who bought this book also bought:
Our Editors also recommend:
Data Structures and Algorithm Analysis in C++, Third Edition by Dr. Clifford A. Shaffer Comprehensive treatment focuses on creation of efficient data structures and algorithms and selection or design of data structure best suited to specific problems. This edition uses C++ as the programming language.
Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
Mathematical Modelling Techniques by Rutherford Aris "Engaging." — Applied Mathematical Modelling. A theoretical chemist and engineer discusses the types of models — finite, statistical, stochastic, and more — as well as how to formulate and manipulate them for best results.
Foundations of Combinatorics with Applications by Edward A. Bender, S. Gill Williamson Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
An Introduction to Mathematical Modeling by Edward A. Bender Accessible text features over 100 reality-based examples pulled from the science, engineering and operations research fields. Prerequisites: ordinary differential equations, continuous probability. Numerous references. Includes 27 black-and-white figures. 1978 edition.
Mathematics for Algorithm and Systems Analysis by Edward A. Bender, S. Gill Williamson Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
A Short Course in Discrete Mathematics by Edward A. Bender, S. Gill Williamson Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition.
Boolean Algebra by R. L. Goodstein This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Boolean Algebra and Its Applications by J. Eldon Whitesitt Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition.
Boolean Reasoning: The Logic of Boolean Equations by Frank Markham Brown Concise text begins with overview of elementary mathematical concepts and outlines theory of Boolean algebras; defines operators for elimination, division, and expansion; covers syllogistic reasoning, solution of Boolean equations, functional deduction. 1990 edition.
Logic and Boolean Algebra by Bradford Henry Arnold This volume concentrates on the structure of Boolean algebras and rings as developed through simpler algebraic systems. The algebra of logic and set theory appears as applications or illustrations throughout. 1962 edition.
Communication Nets: Stochastic Message Flow and Delay by Leonard Kleinrock This text develops a queuing theory model of communications nets. Its realistic assessment of factors involved in message flow will benefit those working with computers and other communications systems. 1964 edition.
Principles of Digital Communication and Coding by Andrew J. Viterbi, Jim K. Omura This classic by two digital communications experts is geared toward students of communications theory and to designers of channels, links, terminals, modems, or networks used to transmit and receive digital messages. 1979 edition.
Computability and Unsolvability by Prof. Martin Davis Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
Discrete Optimization Algorithms: with Pascal Programs by Maciej M. Syslo, Narsingh Deo, Janusz S. Kowalik Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
Dynamic Programming by Richard Bellman Introduction to mathematical theory of multistage decision processes takes a "functional equation" approach. Topics include existence and uniqueness theorems, optimal inventory equation, bottleneck problems, multistage games, Markovian decision processes, and more. 1957 edition.
Dynamic Programming: Models and Applications by Eric V. Denardo Introduction to sequential decision processes covers use of dynamic programming in studying models of resource allocation, methods for approximating solutions of control problems in continuous time, production control, more. 1982 edition.
Elementary Decision Theory by Herman Chernoff, Lincoln E. Moses This well-respected introduction to statistics and statistical theory covers data processing, probability and random variables, utility and descriptive statistics, computation of Bayes strategies, models, testing hypotheses, and much more. 1959 edition.
Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise by Manfred Schroeder A fascinating exploration of the connections between chaos theory, physics, biology, and mathematics, this book abounds in award-winning computer graphics, optical illusions, and games that clarify memorable insights into self-similarity. 1992 edition.
An Illustrated Guide to Linear Programming by Dr. Saul I. Gass Entertaining, nontechnical introduction covers basic concepts of linear programming and its relationship to operations research; geometric interpretation and problem solving, solution techniques, network problems, much more. Only high-school algebra needed.
Linear Programming: Methods and Applications: Fifth Edition by Dr. Saul I. Gass Comprehensive, well-organized volume, suitable for undergraduates, covers theoretical, computational, and applied areas in linear programming. Expanded, updated edition; useful both as a text and as a reference book. 1995 edition.
Methods of Operations Research by Philip M. Morse, George E. Kimball, Dr. Saul I. Gass Operations research originated during World War II with the military's need for a scientific method of providing executives with a quantitative decision-making basis. This text explores strategical kinematics, tactical analysis, gunnery and bombardment problems, more.
Introductory Discrete Mathematics by V. K . Balakrishnan This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.
Linear Programming and Economic Analysis by Robert Dorfman, Paul A. Samuelson, Robert M. Solow Clear, comprehensive exposition of interrelation of game theory and linear programming, interrelation of linear programming and modern welfare economics, Leontief theory of input-output, problems of dynamic linear programming, more.
Mathematical Theory of Computation by Zohar Manna Attempting to make into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects. This self-contained treatment includes selected concepts of computability theory and mathematical logic.
Mathematics for Operations Research by W. H. Marlow Effective procedures for mathematical tasks in many fields: resolving linear independence, finding null spaces and factors of matrices, differentiating vectors and matrices by chain rule, many more. Techniques illustrated in examples. 1,300 problems. 1978 edition.
Nonlinear Programming: Analysis and Methods by Mordecai Avriel This text provides an excellent bridge between principal theories and concepts and their practical implementation. Topics include convex programming, duality, generalized convexity, analysis of selected nonlinear programs, techniques for numerical solutions, and unconstrained optimization methods.
Stochastic Models in Operations Research, Vol. II: Stochastic Optimization by Daniel P. Heyman, Matthew J. Sobel The 2nd of a graduate-level 2-volume set introduces myopic optimal policies, Markov decision processes, generalizations of MDPs and related computational considerations, monotone optimal policies, and sequential games. 1984 edition. Includes 43 figures and 50 tables.
Computer-Controlled Systems: Theory and Design, Third Edition by Dr. Karl J Åström, Dr. Björn Wittenmark This volume features computational tools that can be applied directly and are explained with simple calculations, plus an emphasis on control system principles and ideas. Includes worked examples, MATLAB macros, and solutions manual.
This highly accessible introduction to Lisp is suitable both for novices approaching their first programming language and experienced programmers interested in exploring a key tool for artificial intelligence research. The text offers clear, reader-friendly explanations of such essential concepts as cons cell structures, evaluation rules, programs as data, and recursive and applicative programming styles. The treatment incorporates several innovative instructional devices, such as the use of function boxes in the first two chapters to visually distinguish functions from data, use of evaltrace notation in later chapters to illustrate the operation of evaluation rules, and "Dragon stories" to explain recursion. The book contains nearly 400 diagrams and illustrations, and 77 pages of answers to exercises. Advanced topics and "toolkit" sections, and a variety of complete programs, extend readers' programming power.
Reprint of the Benjamin Cummings Publishing Company, Inc., 1990 edition.
This book was printed in the United States of America.
Dover books are made to last a lifetime. Our US book-manufacturing partners produce the highest quality books in the world and they create jobs for our fellow citizens. Manufacturing in the United States also ensures that our books are printed in an environmentally friendly fashion, on paper sourced from responsibly managed forests.