books tagged “computer science”

›
› Find signed collectible books by ''

English

via
Applications of Discrete Mathematics
by John G. Michaels, Kenneth H. Rosen

ISBN 0070418233 (0-07-041823-3)
Softcover, McGraw-Hill College

Find This Book

› Find signed collectible books: 'Applications of Discrete Mathematics'
Book summary:
Each chapter of this complement to any course in discrete mathematics examines an application to business, computer science, the sciences, or the social sciences. Students work these chapter-length models using basic concepts of combinatorics, graphs, recursion, relations, logic, probability, and finite state machines. [via]
More editions of Applications of Discrete Mathematics:
- Applications of Discrete Mathematics: ISBN 0070418233 (0-07-041823-3)
  Softcover, McGraw-Hill College
via
Applied Cryptography: Protocols, Algorithms, and Source Code in C
by Bruce Schneier

ISBN 0471117099 (0-471-11709-9)
Softcover, John Wiley & Sons Inc

Find This Book

› Find signed collectible books: 'Applied Cryptography: Protocols, Algorithms, and Source Code in C'
Book summary:
After a brief account of the history of cryptography, the latest data on encryption protocols and techniques are explained. Describes present-day applications ranging from electronic cash to anonymous messaging and current security concerns. The second section assumes fairly sophisticated knowledge of the C programming language and features numerous source code fragments. Practical implementations of the code are listed throughout the book's second half. [via]
More editions of Applied Cryptography: Protocols, Algorithms, and Source Code in C:
via
Art of Computer Programming
by Donald E. Knuth

ISBN 0201485419 (0-201-48541-9)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Art of Computer Programming'
Book summary:
Third Edition now available!Volume 2 provides a comprehensive interface between computer programming and numerical analysis. It includes a substantial amount of complexity theory, number theory, and statistics. 0201038226B04062001 [via]
More editions of Art of Computer Programming:
- Art of Computer Programming: ISBN 0201038226 (0-201-03822-6)
  Hardcover, Addison-Wesley
- Art of Computer Programming: ISBN 0201485419 (0-201-48541-9)
  Hardcover, Addison-Wesley
via
The Art of Computer Programming: Fundamental Algorithms
by Donald E. Knuth

ISBN 0201896834 (0-201-89683-4)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The Art of Computer Programming: Fundamental Algorithms'
Book summary:
This magnificent tour de force presents a comprehensive overview of a wide variety of algorithms and the analysis of them. Now in its third edition, The Art of Computer Programming, Volume I: Fundamental Algorithms contains substantial revisions by the author and includes numerous new exercises.
Although this book was conceived several decades ago, it is still a timeless classic. One of the book's greatest strengths is the wonderful collection of problems that accompany each chapter. The author has chosen problems carefully and indexed them according to difficulty. Solving a substantial number of these problems will help you gain a solid understanding of the issues surrounding the given topic. Furthermore, the exercises feature a variety of classic problems.
Fundamental Algorithms begins with mathematical preliminaries. The first section offers a good grounding in a variety of useful mathematical tools: proof techniques, combinatorics, and elementary number theory. Knuth then details the MIX processor, a virtual machine architecture that serves as the programming target for subsequent discussions. This wonderful section comprehensively covers the principles of simple machine architecture, beginning with a register-level discussion of the instruction set. A later discussion of a simulator for this machine includes an excellent description of the principles underlying the implementation of subroutines and co-routines. Implementing such a simulator is an excellent introduction to computer design.
In the second section, Knuth covers data structures--stacks, queues, lists, arrays, and trees--and presents implementations (in MIX assembly) along with techniques for manipulating these structures. Knuth follows many of the algorithms with careful time and space analysis. In the section on tree structures, the discussion includes a series of interesting problems concerning the combinatorics of trees (counting distinct trees of a particular form, for example) and some particularly interesting applications. Also featured is a discussion of Huffmann encoding and, in the section on lists, an excellent introduction to garbage collection algorithms and the difficult challenges associated with such a task. The book closes with a discussion of dynamic allocation algorithms.
The clear writing in Fundamental Algorithms is enhanced by Knuth's dry humor and the historical discussions that accompany the technical matter. Overall, this text is one of the great classics of computer programming literature--it's not an easy book to grasp, but one that any true programmer will study with pleasure. [via]
More editions of The Art of Computer Programming: Fundamental Algorithms:
- The Art of Computer Programming: Fundamental Algorithms: ISBN 0201038099 (0-201-03809-9)
  Hardcover, Addison-Wesley
- The Art of Computer Programming: Fundamental Algorithms: ISBN 0201896834 (0-201-89683-4)
  Hardcover, Addison-Wesley
via
The Art of Computer Programming: Seminumerical Algorithms
by Donald Ervin Knuth

ISBN 0201896842 (0-201-89684-2)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The Art of Computer Programming: Seminumerical Algorithms'
Book summary:
Volume 2 of Donald Knuth's classic series The Art of Computer Programming covers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures--a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers.
The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus.
Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text that's suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer's library. [via]
More editions of The Art of Computer Programming: Seminumerical Algorithms:
- The Art of Computer Programming: Seminumerical Algorithms: ISBN 0201896842 (0-201-89684-2)
  Hardcover, Addison-Wesley
via
The Art of Computer Programming: Sorting and Searching
by Donald Ervin Knuth

ISBN 0201896850 (0-201-89685-0)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The Art of Computer Programming: Sorting and Searching'
Book summary:
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.

The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
ISBN: 0321751043
[via]
More editions of The Art of Computer Programming: Sorting and Searching:
- The Art of Computer Programming: Sorting and Searching: ISBN 0201896850 (0-201-89685-0)
  Hardcover, Addison-Wesley
via
The Art Of Computer Programming, Fascicle 1: MMIX -- A RISC Computer For The New Millennium
by Not Available

ISBN 0201853922 (0-201-85392-2)
Softcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The Art Of Computer Programming, Fascicle 1: MMIX -- A RISC Computer For The New Millennium'
Book summary:
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.

The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

ISBN: 0321751043

Art of Computer Programming, Volume 1, Fascicle 1, The: MMIX -- A RISC Computer for the New Millennium

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published t regular intervals. Each fascicle will encompass a section or more of wholly new or evised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

Volume 1, Fascicle 1
This first fascicle updates The Art of Computer Programming, Volume 1, Third Edition: Fundamental Algorithms, and ultimately will become part of the fourth edition of that book. Specifically, it provides a programmer's introduction to the long-awaited MMIX, a RISC-based computer that replaces the original MIX, and describes the MMIX assembly language. The fascicle also presents new material on subroutines, coroutines, and interpretive routines.

[via]
More editions of The Art Of Computer Programming, Fascicle 1: MMIX -- A RISC Computer For The New Millennium:
- The Art Of Computer Programming, Fascicle 1: MMIX -- A RISC Computer For The New Millennium: ISBN 0201853922 (0-201-85392-2)
  Softcover, Addison-Wesley
via
The art Of Computer Programming, Fascicle 3: Generating All Combinations And Partitions
by Not Available

ISBN 0201853949 (0-201-85394-9)
Softcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The art Of Computer Programming, Fascicle 3: Generating All Combinations And Partitions'
Book summary:
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.

The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

ISBN: 0321751043

Art of Computer Programming, Volume 4, Fascicle 3, The: Generating All Combinations and Partitions: Generating All Combinations and Partitions

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

Volume 4, Fascicle 3
This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of The Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions. In Knuth's thorough discussion of these two topics, readers will find much that is new, as well as surprisingly rich ties to material in Volumes 1 through 3 and to other aspects of computer science and mathematics. As usual, this fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

[via]
More editions of The art Of Computer Programming, Fascicle 3: Generating All Combinations And Partitions:
- The art Of Computer Programming, Fascicle 3: Generating All Combinations And Partitions: ISBN 0201853949 (0-201-85394-9)
  Softcover, Addison-Wesley
via
Art of Computer Programming/Sorting and Searching.
by Donald E. Knuth

ISBN 020103803X (0-201-03803-X)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Art of Computer Programming/Sorting and Searching.'
Book summary:
The first revision of this third volume is a survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. [via]
More editions of Art of Computer Programming/Sorting and Searching.:
- Art of Computer Programming/Sorting and Searching.: ISBN 020103803X (0-201-03803-X)
  Hardcover, Addison-Wesley
via
Artificial Intelligence: A Modern Approach
by Stuart J. Russell, Peter Norvig

ISBN 0137903952 (0-13-790395-2)
Hardcover, Prentice Hall

Find This Book

› Find signed collectible books: 'Artificial Intelligence: A Modern Approach'
Book summary:
Artificial Intelligence: A Modern Approach introduces basic ideas in artificial intelligence from the perspective of building intelligent agents, which the authors define as "anything that can be viewed as perceiving its environment through sensors and acting upon the environment through effectors." This textbook is up-to-date and is organized using the latest principles of good textbook design. It includes historical notes at the end of every chapter, exercises, margin notes, a bibliography, and a competent index. Artificial Intelligence: A Modern Approach covers a wide array of material, including first-order logic, game playing, knowledge representation, planning, and reinforcement learning. [via]
More editions of Artificial Intelligence: A Modern Approach:
- Artificial Intelligence: A Modern Approach: ISBN 0131038052 (0-13-103805-2)
  Hardcover, Prentice Hall
- Artificial Intelligence: A Modern Approach: ISBN 0137903952 (0-13-790395-2)
  Hardcover, Prentice Hall
via
C Programming Language
by Brian W. Kernighan, Dennis M. Ritchie

ISBN 0131101633 (0-13-110163-3)
Hardcover, Prentice-Hall

Find This Book

› Find signed collectible books: 'C Programming Language'
Book summary:
An indisputably classic computing text, Kernighan and Ritchie's The C Programming Language, 2nd Edition, is the standard reference for learning and using ANSI C. Written by the co-inventors of C, this concise tutorial has a well-deserved reputation for clarity and precision as it defines one of the most successful programming languages of all time. It's an essential reference, which will be useful for beginners and experienced programmers alike.
This masterful tour of C features concentrates on essential programming constructs, from the basics--such as data types, variables, operators and flow control--to more advanced topics. Short, effective programming samples are the rule here. (Many samples work with strings and text files). Along the way, the authors don't shy away from the thornier C topics. For example, when discussing pointers, they look at pointers to pointers and even pointers to functions. Later in the book, they offer useful code for a flexible memory allocation scheme and a binary tree. The text concludes with the formal specification for C and a compact listing of the functions in the C standard header files.
C is still a great first programming language, and its influence is felt in Java and C++, both of which support many programming constructs based on C, while adding support for objects. The C Programming Language is still an excellent reference to one of our most successful and efficient programming languages. It's a book that deserves a place on the bookshelf of any C/C++ developer, regardless of your experience with the language. --Richard Dragan, Amazon.com
Topics covered:
- overview of ANSI C
- introductory language tutorial
- data types
- variables
- arrays
- operators and operator precedence
- flow control
- functions
- header files
- recursion
- macros and the C pre-processor
- pointers and arrays
- advanced pointer types (pointers to pointers, pointers to functions)
- multidimensional arrays
- structures and unions
- dynamic memory allocation
- console and file I/O
- UNIX file functions
- Formal description of the standard C language
- Reference to C standard library header files and functions
[via]
More editions of C Programming Language:
- C Programming Language: ISBN 0131103709 (0-13-110370-9)
  Hardcover, Prentice Hall
- C Programming Language: ISBN 0131101633 (0-13-110163-3)
  Hardcover, Prentice-Hall
via
The C Programming Language: ANSI C Version
by Brian W. Kernighan

ISBN 0131103628 (0-13-110362-8)
Softcover, Prentice Hall

Find This Book

› Find signed collectible books: 'The C Programming Language: ANSI C Version'
Book summary:
An indisputably classic computing text, Kernighan and Ritchie's The C Programming Language, 2nd Edition, is the standard reference for learning and using ANSI C. Written by the co-inventors of C, this concise tutorial has a well-deserved reputation for clarity and precision as it defines one of the most successful programming languages of all time. It's an essential reference, which will be useful for beginners and experienced programmers alike.
This masterful tour of C features concentrates on essential programming constructs, from the basics--such as data types, variables, operators and flow control--to more advanced topics. Short, effective programming samples are the rule here. (Many samples work with strings and text files). Along the way, the authors don't shy away from the thornier C topics. For example, when discussing pointers, they look at pointers to pointers and even pointers to functions. Later in the book, they offer useful code for a flexible memory allocation scheme and a binary tree. The text concludes with the formal specification for C and a compact listing of the functions in the C standard header files.
C is still a great first programming language, and its influence is felt in Java and C++, both of which support many programming constructs based on C, while adding support for objects. The C Programming Language is still an excellent reference to one of our most successful and efficient programming languages. It's a book that deserves a place on the bookshelf of any C/C++ developer, regardless of your experience with the language. --Richard Dragan, Amazon.com
Topics covered:
- overview of ANSI C
- introductory language tutorial
- data types
- variables
- arrays
- operators and operator precedence
- flow control
- functions
- header files
- recursion
- macros and the C pre-processor
- pointers and arrays
- advanced pointer types (pointers to pointers, pointers to functions)
- multidimensional arrays
- structures and unions
- dynamic memory allocation
- console and file I/O
- UNIX file functions
- Formal description of the standard C language
- Reference to C standard library header files and functions
[via]
More editions of The C Programming Language: ANSI C Version:
- The C Programming Language: ANSI C Version: ISBN 0131103628 (0-13-110362-8)
  Softcover, Prentice Hall
The C++ Programming Language
by Bjarne Stroustrup

ISBN 0201889544 (0-201-88954-4)
Softcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The C++ Programming Language'
Book summary:
More than three-quarters of a million programmers have benefited from this book in all of its editions Written by Bjarne Stroustrup, the creator of C++, this is the world's most trusted and widely read book on C++. For this special hardcover edition, two new appendixes on locales and standard library exception safety (also available at www.research.att.com/~bs/) have been added. The result is complete, authoritative coverage of the C++ language, its standard library, and key design techniques. Based on the ANSI/ISO C++ standard, The C++ Programming Language provides current and comprehensive coverage of all C++ language features and standard library components. For example: abstract classes as interfaces class hierarchies for object-oriented programming templates as the basis for type-safe generic software exceptions for regular error handling namespaces for modularity in large-scale software run-time type identification for loosely coupled systems the C subset of C++ for C compatibility and system-level work standard containers and algorithms standard strings, I/O streams, and numerics C compatibility, internationalization, and exception safety Bjarne Stroustrup makes C++ even more accessible to those new to the language, while adding advanced information and techniques that even expert C++ programmers will find invaluable. [via]
More editions of The C++ Programming Language:
via
Compilers : Principles, Techniques, and Tools
by Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman

ISBN 0321486811 (0-321-48681-1)
Hardcover, Pearson Education Canada

Find This Book

› Find signed collectible books: 'Compilers : Principles, Techniques, and Tools'
Book summary:
Compilers: principles, techniques and tools, known to professors, students, and developers worldwide as the "dragon book," is available in a new edition. every chapter has been completely revised to reflect developments in software engineering, programming languages, and computer architecture that have occurred since 1986, when the last edition published. the authors, recognizing that few readers will ever go on to construct a compiler, retain their focus on the broader set of problems faced in software design and software development [via]
More editions of Compilers : Principles, Techniques, and Tools:
- Compilers : Principles, Techniques, and Tools: ISBN 0321486811 (0-321-48681-1)
  Hardcover, Pearson Education Canada
via
Compilers: Principles, Techniques, and Tools
by Jeffrey D. Ullman, Alfred V. Aho, Ravi Sethi

ISBN 0201100886 (0-201-10088-6)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Compilers: Principles, Techniques, and Tools'
Book summary:
This introduction to compilers is the direct descendant of the well-known book by Aho and Ullman, Principles of Compiler Design. The authors present updated coverage of compilers based on research and techniques that have been developed in the field over the past few years. The book provides a thorough introduction to compiler design and covers topics such as context-free grammars, fine state machines, and syntax-directed translation. 0201100886B04062001 [via]
More editions of Compilers: Principles, Techniques, and Tools:
- Compilers: Principles, Techniques, and Tools: ISBN 0201100886 (0-201-10088-6)
  Hardcover, Addison-Wesley
via
Computer Graphics: Principles and Practice
by Andries Van Dam, James D. Foley, Steven K. Feiner, John F. Hughes

ISBN 0201848406 (0-201-84840-6)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Computer Graphics: Principles and Practice'
Book summary:
The long-awaited second edition of this book has been completely rewritten to provide the most comprehensive authoritative and up-to-date coverage of the field---making it the standard computer graphics reference work for the 1990s. The authors provide a unique combination of current concepts and practical applications. The important algorithms in 2d and 3d graphics are detailed for easy implementation [via]
More editions of Computer Graphics: Principles and Practice:
- Computer Graphics: Principles and Practice: ISBN 0201121107 (0-201-12110-7)
  Hardcover, Addison-Wesley
- Computer Graphics: Principles and Practice: ISBN 0201848406 (0-201-84840-6)
  Hardcover, Addison-Wesley
via
Computer Networks
by Andrew Tanenbaum

ISBN 0130661023 (0-13-066102-3)
Hardcover, Prentice Hall

Find This Book

› Find signed collectible books: 'Computer Networks'
Book summary:
This is the long-awaited 3rd Edition of Tanenbaum's classic book on computer networking. The finest network engineer I know (who was stolen from my previous employer by developers of IPv6) swears by this book, and it is arguably the best single resource for gaining a good technical understanding of modern networking in the mid 1990s. Very Highly Recommended. [via]
More editions of Computer Networks:
via
Computer Networks: International Edition
by Andrew S. Tanenbaum

ISBN 0133942481 (0-13-394248-1)
Softcover, Prentice Hall

Find This Book

› Find signed collectible books: 'Computer Networks: International Edition'
More editions of Computer Networks: International Edition:
- Computer Networks: International Edition: ISBN 0133942481 (0-13-394248-1)
  Softcover, Prentice Hall
via
Computer Organization and Design: The Hardware/Software Interface
by David Patterson

ISBN 155860491X (1-55860-491-X)
Softcover, Elsevier Science Ltd

Find This Book

› Find signed collectible books: 'Computer Organization and Design: The Hardware/Software Interface'
Book summary:
The authors provide a comprehensive, detailed, and highly technical overview of computer design, going right to the hardware/software interface where data and instructions have their physical representation. While much of the book centers on processor architectures and memory design, it also offers strong background sections on computer arithmetic, machine instructions, performance measurement, and the historical development of computer systems. A natural for any electrical engineer interested in the field of computer architecture and design, this volume will also prove highly valuable for computer scientists and programmers in any low- or high-level language. [via]
More editions of Computer Organization and Design: The Hardware/Software Interface:
via
Computers and Intractability: A Guide to the Theory of Np-Completeness
by Michael R. Garey, David S. Johnson

ISBN 0716710455 (0-7167-1045-5)
Softcover, W H Freeman & Co

Find This Book

› Find signed collectible books: 'Computers and Intractability: A Guide to the Theory of Np-Completeness'
Book summary:
This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people." This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.
The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; Computers and Intractability does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) Computers and Intractability also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references. [via]
More editions of Computers and Intractability: A Guide to the Theory of Np-Completeness:
- Computers and Intractability: A Guide to the Theory of Np-Completeness: ISBN 0716710447 (0-7167-1044-7)
  Hardcover, W. H. Freeman
- Computers and Intractability: A Guide to the Theory of Np-Completeness: ISBN 0716710455 (0-7167-1045-5)
  Softcover, W H Freeman & Co
via
Concrete Mathematics: A Foundation for Computer Science
by Ronald L. Graham

ISBN 0201558025 (0-201-55802-5)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Concrete Mathematics: A Foundation for Computer Science'
Book summary:
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete mathematics is a blending of continuous and discrete mathematics. "more concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." the subject matter is primarily an expansion of the mathematical preliminaries section in knuth's classic art of computer programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories.complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: *sums *recurrences *integer functions *elementary number theory *binomial coefficients *generating functions *discrete probability *asymptotic methods this second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of concrete mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. [via]
More editions of Concrete Mathematics: A Foundation for Computer Science:
- Concrete Mathematics: A Foundation for Computer Science: ISBN 0201142368 (0-201-14236-8)
  Hardcover, Addison-Wesley
- Concrete Mathematics: A Foundation for Computer Science: ISBN 0201558025 (0-201-55802-5)
  Hardcover, Addison-Wesley
via
Design Patterns: Elements of Reusable Object-Oriented Software
by Ralph Johnson, Erich Gamma, John Vlissides, Richard Helm

ISBN 0201633612 (0-201-63361-2)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Design Patterns: Elements of Reusable Object-Oriented Software'
Book summary:
Published in 1995, design patterns: elements of reusable object-oriented software has elicited a great deal of praise from the press and readers. The 23 patterns contained in the book have become an essential resource for anyone developing reusable software designs. In response to a great number of requests from readers of the book and from the object-oriented community as a whole, these designs patterns, along with the entire text of the book, are being made available on cd. This electronic version will enable students to install the patterns directly onto a computer and create an architecture for using and building reusable components. Produced in html format, the cd is heavily cross-referenced with numerous links to the online text [via]
More editions of Design Patterns: Elements of Reusable Object-Oriented Software:
- Design Patterns Cd: Elements of Reusable Object-Oriented Software: ISBN 0201634988 (0-201-63498-8)
  Hardcover, Addison-Wesley
- Design Patterns: Elements of Reusable Object-Oriented Software: ISBN 0201633612 (0-201-63361-2)
  Hardcover, Addison-Wesley
via
Discrete Mathematics and Its Applications
by Kenneth H. Rosen

ISBN 0073229725 (0-07-322972-5)
Hardcover, McGraw-Hill Science Engineering

Find This Book

› Find signed collectible books: 'Discrete Mathematics And Its Applications'
Book summary:
This text provides a balanced survey of major sub-fields within discrete mathematics. It demonstrates the utility of discrete mathematics in the solutions of real-world problems in diverse areas such as zoology, linguistics and business. Over 200 new problems have been added to this third edition. [via]
More editions of Discrete Mathematics and Its Applications:
via
Discrete Mathematics and Its Applications: And Its Applications
by Kenneth H. Rosen

ISBN 0072880082 (0-07-288008-2)
Hardcover, McGraw-Hill College

Find This Book

› Find signed collectible books: 'Discrete Mathematics and Its Applications: And Its Applications'
Book summary:
discrete mathematics and its applications, sixth edition", is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 600 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications...from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields [via]
More editions of Discrete Mathematics and Its Applications: And Its Applications:
- Discrete Mathematics and Its Applications: And Its Applications: ISBN 0072880082 (0-07-288008-2)
  Hardcover, McGraw-Hill College
via
Discrete Mathematics And Its Applications With Mathzone
by Kenneth H. Rosen

ISBN 0073312711 (0-07-331271-1)
Hardcover, McGraw-Hill College

Find This Book

› Find signed collectible books: 'Discrete Mathematics And Its Applications With Mathzone'
Book summary:
Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications&from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields. [via]
More editions of Discrete Mathematics And Its Applications With Mathzone:
- Discrete Mathematics And Its Applications With Mathzone: ISBN 0073312711 (0-07-331271-1)
  Hardcover, McGraw-Hill College
via
Godel, Escher, Bach: An Eternal Golden Braid
by Douglas R. Hofstadter

ISBN 0465026567 (0-465-02656-7)
Softcover, Basic Books

Find This Book

› Find signed collectible books: 'Godel, Escher, Bach: An Eternal Golden Braid'
Book summary:
As stated in the Scientific American, "Every few decades an unknown author brings out a boof of such depth, clarity range, wit beauty and originality that it is recognized at once as a major literary event - this is such a work." [via]
More editions of Godel, Escher, Bach: An Eternal Golden Braid:
via
Introduction to Algorithms
by Thomas H. Cormen, Charles E. Leiserson

ISBN 0262531968 (0-262-53196-8)
Softcover, Mit Pr

Find This Book

› Find signed collectible books: 'Introduction to Algorithms'
Book summary:
Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.
With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.
This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.
Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. --Richard Dragan
Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions). [via]
More editions of Introduction to Algorithms:
via
Introduction to Automata Theory, Languages, And Computation
by Jeffrey D. Ullman, John E. Hopcroft, Rajeev Motwani

ISBN 0321462254 (0-321-46225-4)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Introduction to Automata Theory, Languages, And Computation'
Book summary:
It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material. [via]
More editions of Introduction to Automata Theory, Languages, And Computation:
via
Introduction to Automata, Theory, Languages and Computation
by John E. Hopcroft

ISBN 020102988X (0-201-02988-X)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Introduction to Automata, Theory, Languages and Computation'
Book summary:
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments. [via]
More editions of Introduction to Automata, Theory, Languages and Computation:
- Introduction to Automata, Theory, Languages and Computation: ISBN 020102988X (0-201-02988-X)
  Hardcover, Addison-Wesley
via
Introduction to Computer Graphics
by Andries Van Dam, James D. Foley, Steven K. Feiner

ISBN 0201609215 (0-201-60921-5)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Introduction to Computer Graphics'
Book summary:
This adaptation of the definitive book in the field (Computer Graphics, Second Edition by Foley, et al.,) provides a more concise, less expensive introduction to computer graphics. While retaining the currency and accuracy of the larger work, coverage has been trimmed to the essential topics. Explanations of key concepts have been expanded and further illustrated, assuming less background on the part of the reader. This brief version uses C as the programming language for all worked examples. An Introduction to Computer Graphics does not replace the highly regarded Second Edition of Foley, et al., but simply offers professionals the option of a briefer, less expensive version. [via]
More editions of Introduction to Computer Graphics:
- Introduction to Computer Graphics: ISBN 0201609215 (0-201-60921-5)
  Hardcover, Addison-Wesley
via
Introduction to the Theory of Computation
by Michael Sipser

ISBN 0534950973 (0-534-95097-3)
Hardcover, Course Technology Ptr

Find This Book

› Find signed collectible books: 'Introduction to the Theory of Computation'
Book summary:
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms. [via]
More editions of Introduction to the Theory of Computation:
via
Metamagical Themas: Questing for the Essence of Mind and Pattern
by Douglas R. Hofstadter

ISBN 0465045669 (0-465-04566-9)
Softcover, Perseus Books

Find This Book

› Find signed collectible books: 'Metamagical Themas: Questing for the Essence of Mind and Pattern'
Book summary:
An interlocked collection of literary, scientific, and artistic studies. [via]
More editions of Metamagical Themas: Questing for the Essence of Mind and Pattern:
via
Modern Operating Systems
by Andrew S. Tanenbaum

ISBN 0130926418 (0-13-092641-8)
Softcover, Prentice Hall

Find This Book

› Find signed collectible books: 'Modern Operating Systems'
Book summary:
For software development professionals and computer science students, Modern Operating Systems gives a solid conceptual overview of operating system design, including detailed case studies of Unix/Linux and Windows 2000.
Readers familiar with Tanenbaum's previous text, Operating Systems, know the author is a great proponent of simple design and hands-on experimentation. His earlier book came bundled with the source code for an operating system called Minux, a simple variant of Unix and the platform used by Linus Torvalds to develop Linux. Although this book does not come with any source code, he illustrates many of his points with code fragments (C, usually with Unix system calls).
The first half of Modern Operating Systems focuses on traditional operating systems concepts: processes, deadlocks, memory management, I/O, and file systems. There is nothing ground-breaking in these early chapters, but all topics are well covered, each including sections on current research and a set of student problems. It is the second half of the book that differentiates itself from older operating systems texts. Here, each chapter describes an element of what constitutes a modern operating system--awareness of multimedia applications, multiple processors, computer networks, and a high level of security. The chapter on multimedia functionality focuses on such features as handling massive files and providing video-on-demand. Included in the discussion on multiprocessor platforms are clustered computers and distributed computing. Finally, the importance of security is discussed--a lively enumeration of the scores of ways operating systems can be vulnerable to attack, from password security to computer viruses and Internet worms.
Included at the end of the book are case studies of two popular operating systems: Unix/Linux and Windows 2000. There is a bias toward the Unix/Linux approach, not surprising given the author's experience and academic bent, but this bias does not detract from Tanenbaum's analysis. Both operating systems are dissected, describing how each implements processes, file systems, memory management, and other operating system fundamentals.
Tanenbaum's mantra is a simple, accessible operating system design. Given that modern operating systems have extensive features, he is forced to reconcile physical size with simplicity. Towards this end, he makes frequent references to the Frederick Brooks classic The Mythical Man Month for wisdom on managing large, complex software development projects. He finds both Windows 2000 and Unix/Linux guilty of being too complicated--with a particular skewering of Windows 2000 and its "mammoth Win32 API". A primary culprit is the attempt to make operating systems more "user-friendly," which Tanenbaum views as an excuse for bloated code. The solution is to have smart people, the smallest possible team, and well-defined interactions between various operating systems components. Future operating system design will benefit if the advice in this book is taken to heart. --Pete Ostenson [via]
More editions of Modern Operating Systems:
via
The Mythical Man-Month: Essays on Software Engineering
by Frederick Phillips Brooks

ISBN 0201835959 (0-201-83595-9)
Softcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'The Mythical Man-Month: Essays on Software Engineering'
Book summary:
Classic book on the human elements of software engineering. [via]
More editions of The Mythical Man-Month: Essays on Software Engineering:
- The Mythical Man-Month: Essays on Software Engineering: ISBN 0201006502 (0-201-00650-2)
  Softcover, Addison-Wesley
- The Mythical Man-Month: Essays on Software Engineering: ISBN 0201835959 (0-201-83595-9)
  Softcover, Addison-Wesley
via
Operating System Concepts
by Abraham Silberschatz, Greg Gagne, Peter Baer Galvin

ISBN 0471694665 (0-471-69466-5)
Hardcover, John Wiley & Sons Inc

Find This Book

› Find signed collectible books: 'Operating System Concepts'
Book summary:
Another defining moment in the evolution of operating systems
Small footprint operating systems, such as those driving the handheld devices that the baby dinosaurs are using on the cover, are just one of the cutting-edge applications you'll find in Silberschatz, Galvin, and Gagne's Operating System Concepts, Seventh Edition.
By staying current, remaining relevant, and adapting to emerging course needs, this market-leading text has continued to define the operating systems course. This Seventh Edition not only presents the latest and most relevant systems, it also digs deeper to uncover those fundamental concepts that have remained constant throughout the evolution of today's operation systems. With this strong conceptual foundation in place, students can more easily understand the details related to specific systems.
New Adaptations
* Increased coverage of user perspective in Chapter 1.
* Increased coverage of OS design throughout.
* A new chapter on real-time and embedded systems (Chapter 19).
* A new chapter on multimedia (Chapter 20).
* Additional coverage of security and protection.
* Additional coverage of distributed programming.
* New exercises at the end of each chapter.
* New programming exercises and projects at the end of each chapter.
* New student-focused pedagogy and a new two-color design to enhance the learning process. [via]
More editions of Operating System Concepts:
- Operating System Concepts: ISBN 0471694665 (0-471-69466-5)
  Hardcover, John Wiley & Sons Inc
via
Operating System Concepts with JAVA
by Abraham Silberschatz, James Lyle Peterson

ISBN 0201187604 (0-201-18760-4)
Hardcover, Addison-Wesley

Find This Book

› Find signed collectible books: 'Operating System Concepts with JAVA'
Book summary:
Operating systems are large and complex, and yet must function with near-absolute reliability--that's why they're a class unto themselves in the field of software development. Since its first release 20 years ago, "the dinosaur book"--Operating System Concepts by Avi Silberschatz, Peter Baer Galvin, and Greg Gagne--has been a valuable reference for designers and implementers of operating systems. The newly released sixth edition of this book maintains the volume's authority with new sections on thread management, distributed processes, and the Java Virtual Machine (JVM). There's also information on the workings of the latest crop of operating systems, including Microsoft Windows 2000, Linux, FreeBSD, and compact operating systems for handheld devices.
This book is concerned with the design of operating systems, which is to say it enumerates the problems that pop up in the creation of efficient systems and explores alternative ways of dealing with them, detailing the advantages and shortcomings of each. For example, in their chapter on scheduling CPU activity, the authors explain several algorithms (first-come, first-served, and round-robin scheduling, among others) for allocating the capacity of single and multiple processors among jobs. They highlight the relative advantages of each, and explain how several real-life operating systems solve the problem. They then present the reader with exercises--this book is essentially a university textbook--that inspire thought and discussion. --David Wall
Topics covered: The problems faced by designers of system software for electronic computers, and strategies that have been developed over the past 20 years to address (and, in some cases, solve ) them. Problems of CPU scheduling, memory allocation, paging, processes and threads, storage management, distributed processes and storage mechanisms, and security are all discussed thoroughly and with many authoritative references. [via]
More editions of Operating System Concepts with JAVA:
via
Programming Perl
by Larry Wall, Tom Christiansen, Jon Orwant

ISBN 0596000278 (0-596-00027-8)
Softcover, Oreilly & Associates Inc

Find This Book

› Find signed collectible books: 'Programming Perl'
Book summary:
This is the authoritative guide to the hottest new UNIX utility in years, coauthored by its creator, Larry Wall. Perl is a language for easily manipulating text, files, and processes. Perl provides a more concise and readable way to do many jobs that were formerly accomplished (with difficulty) by programming in the C language or one of the shells. Even though Perl is not yet a standard part of UNIX, it is likely to be available wherever you choose to work. And if it isn't, you can get it and install it easily and free of charge. Contents include: An introduction to Perl Common tasks with Perl Real Perl programs; includes database manipulation, programming aids, system administration, text and filename manipulation, interprocess communication, and more Perl syntax Perl functions Other oddments; invocation options, debugging, efficiency, the Perl library, linking in C subroutines, etc. Also includes a pull-out quick-reference card (designed and created by Johan Vromans). [via]
More editions of Programming Perl:
- Programming Perl: ISBN 0937175641 (0-937175-64-1)
  Softcover, Oreilly & Associates Inc
- Programming Perl: ISBN 0596000278 (0-596-00027-8)
  Softcover, Oreilly & Associates Inc
via
Programming Perl
by Stephen Potter, Larry Wall, Randal L. Schwartz, Tom Christiansen

ISBN 1565921496 (1-56592-149-6)
Softcover, Oreilly & Associates Inc

Find This Book

› Find signed collectible books: 'Programming Perl'
Book summary:
The second edition of the Camel Book is more than 600 pages long and full of excellent instruction and sound advice. Topics include all the good stuff from the first edition plus Perl 5 features such as nested data structures (ever made a hash of arrays of hashes?), modules, and objects. From "Howdy World" to making your own modules, this book has it all. [via]
More editions of Programming Perl:
- Programming Perl: ISBN 1565921496 (1-56592-149-6)
  Softcover, Oreilly & Associates Inc
via
Structure and Interpretation of Computer Programs
by Harold Abelson, Julie Sussman, Gerald Jay Sussman

ISBN 0262510871 (0-262-51087-1)
Softcover, Mit Pr

Find This Book

› Find signed collectible books: 'Structure and Interpretation of Computer Programs'
Book summary:
Abelson and Sussman's classic Structure and Interpretation of Computer Programs teaches readers how to program by employing the tools of abstraction and modularity. The authors' central philosophy is that programming is the task of breaking large problems into small ones. The book spends a great deal of time considering both this decomposition and the process of knitting the smaller pieces back together.
The authors employ this philosophy in their writing technique. The text asks the broad question "What is programming?" Having come to the conclusion that programming consists of procedures and data, the authors set off to explore the related questions of "What is data?" and "What is a procedure?"
The authors build up the simple notion of a procedure to dizzying complexity. The discussion culminates in the description of the code behind the programming language Scheme. The authors finish with examples of how to implement some of the book's concepts on a register machine. Through this journey, the reader not only learns how to program, but also how to think about programming. [via]
More editions of Structure and Interpretation of Computer Programs:

Spanish

via
Gdel, Escher, Bach
by D.R. Hofstadter

ISBN 8472234592 (84-7223-459-2)
Softcover, Tusquets Editor

Find This Book

› Find signed collectible books: 'Gdel, Escher, Bach'
Book summary:
¿Puede un sistema comprenderse a sí mismo ? Si esta pregunta se refiere a la mente humana, entonces nos encontramos ante una cuestión clave del pensamiento científico. Y de la filosofía. Y del arte. Investigar este misterio es una aventura que recorre la matemática, la física, la biología, la psicología y, muy especialmente, el lenguaje. Douglas R. Hofstadter, joven y ya célebre científico, nos abre la puerta del enigma con la belleza y la alegría creadora de su estilo. Sorprendentes paralelismos ocultos entre los grabados de Escher y la música de Bach nos remiten a las paradojas clásicas de los antiguos griegos y a un teorema de la lógica matemática moderna que ha estremecido el pensamiento del siglo XX : el de Kurt Gödel. Todo lenguaje, todo sistema formal, todo programa de ordenador, todo proceso de pensamiento, llegan, tarde o temprano, a la situación límite de la autorreferencia : de querer expresarse sobre sí mismos. Surge entonces la emoción del infinito, como dos espejos enfrentados y obligados a reflejarse mutua e indefinidamente. Gödel, Escher, Bach: un Eterno y Grácil Bucle, es una obra de arte escrita por un sabio. Versa sobre los misterios del pensamiento e incluye, ella misma, sus propios misterios. / Winner of the Pulitzer Prize, this book applies Godel's seminal contribution to modern Twenty years after it topped the bestseller charts, Douglas R. Hofstadter's Gödel, Escher, Bach: An Eternal Golden Braid is still something of a marvel. Besides being a profound and entertaining meditation on human thought and creativity, this book looks at the surprising points of contact between the music of Bach, the artwork of Escher, and the mathematics of Gödel.mathematics to the study of the human mind and the development of artificial intelligence. [via]
More editions of Gdel, Escher, Bach:
- Gdel, Escher, Bach: ISBN 8472234592 (84-7223-459-2)
  Softcover, Tusquets Editor

Results page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 NEXT

		Search \| About \| Preferences \| Interact \| Help

150 million books. 1 search engine.	Search Author, Title or ISBN