Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Introduction to Precise Numerical Methods, Second Edition
Introduction to Precise Numerical Methods, Second Edition
Now that powerful PCs and Macs are everywhere available, when solving a numerical problem, we should no longer be content with an indefinite answer, that is, an answer where the error bound is either unknown or a vague guess. This book’s software allows you to obtain your numerical answers to a prescribed number of correct decimal places. For...
Think Complexity: Complexity Science and Computational Modeling
Think Complexity: Complexity Science and Computational Modeling
This book is inspired by boredom and fascination: boredom with the usual presentation of data structures and algorithms, and fascination with complex systems. The problem with data structures is that they are often taught without a motivating context; the problem with complexity science is that it is usually not taught at...
Handbook of Data Structures and Applications
Handbook of Data Structures and Applications

Handbook of Data Structures and Applications responds to the needs of data structure and algorithm researchers by providing a comprehensive survey of data structures of various types. Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-know classes of data structures, Priority...

Coders at Work
Coders at Work

Peter Seibel interviews 15 of the most interesting computer programmers alive today in Coders at Work, offering a brand-new companion volume to Apress’s highly acclaimed best-seller Founders at Work by Jessica Livingston. As the words “at work” suggest, Peter Seibel focuses on how his...

Computability Theory: An Introduction to Recursion Theory
Computability Theory: An Introduction to Recursion Theory

The study of the class of computable partial functions (i.e., recursive partial functions) stands at the intersection of three fields: mathematics, theoretical computer science, and philosophy.

Mathematically, computability theory originates from the concept of an algorithm. It leads to a classification of functions according...

Semantic Techniques in Quantum Computation
Semantic Techniques in Quantum Computation

The idea of quantum computation, in the algorithmic sense, originated from the suggestion by Feynman (1982) that a computer based on the principles of quantum mechanics might be capable of efficiently simulating quantum systems of interest to physicists; such simulation seems to be very difficult with classical computers. Feynman’s...

The Measure of All Minds: Evaluating Natural and Artificial Intelligence
The Measure of All Minds: Evaluating Natural and Artificial Intelligence

Are psychometric tests valid for a new reality of artificial intelligence systems, technology-enhanced humans, and hybrids yet to come? Are the Turing Test, the ubiquitous CAPTCHAs, and the various animal cognition tests the best alternatives? In this fascinating and provocative book, José Hernández-Orallo formulates major...

An Introduction to 3D Computer Vision Techniques and Algorithms
An Introduction to 3D Computer Vision Techniques and Algorithms

Computer vision encompasses the construction of integrated vision systems and the application of vision to problems of real-world importance. The process of creating 3D models is still rather difficult, requiring mechanical measurement of the camera positions or manual alignment of partial 3D views of a scene. However using algorithms, it is...

Computability and Complexity Theory (Texts in Computer Science)
Computability and Complexity Theory (Texts in Computer Science)

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations.  Subsequent chapters move from the qualitative aspects of...

Pattern Calculus: Computing with Functions and Structures
Pattern Calculus: Computing with Functions and Structures

The pattern calculus is a new foundation for computation, in which the expressive power of functions and of data structures are combined within pattern-matching functions. The best existing foundations focus on either functions, as in the lambda-calculus, or on data structures, as in Turing machines, or on compromises involving both, as in...

Computer Science -- Theory and Applications: 7th International Computer Science Symposium in Russia, CSR 2012
Computer Science -- Theory and Applications: 7th International Computer Science Symposium in Russia, CSR 2012

This book constitutes the proceedings of the 7th International Computer Science Symposium in Russia, CSR 2012, held in Nizhny Novgorod in July 2012. The 28 full papers presented in this volume were carefully reviewed and selected from 66 submissions. CSR 2012 was one of the events of the Alan Turing Year 2012, the topics dealt with cover...

Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation (Pragmatic Programmers)
Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation (Pragmatic Programmers)

Mathematics is beautiful--and it can be fun and exciting as well as practical. Good Math is your guide to some of the most intriguing topics from two thousand years of mathematics: from Egyptian fractions to Turing machines; from the real meaning of numbers to proof trees, group symmetry, and mechanical computation. If you've ever...

Result Page: 6 5 4 3 2 1 
©2018 LearnIT (support@pdfchm.net) - Privacy Policy