Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
A Brief History of Computing
A Brief History of Computing
The history of computing has its origins at the outset of civilization. As towns and communities evolved there was a need for increasingly sophisticated calculations. This book traces the evolution of computation, from early civilisations 3000 B.C. to the latest key developments in modern times.

This useful and lively text provides a...

Mind Design II: Philosophy, Psychology, and Artificial Intelligence
Mind Design II: Philosophy, Psychology, and Artificial Intelligence
"Ming Design II is a welcome update of its predecessor, itself a useful compendium on the philosophy of cognitive science. This new volume retains the intellectual foundations, and some discussions of classical AI built on them, while adding connectionism, situated AI, and dynamic systems theory as extra storeys. Which of these is...
Turing (A Novel about Computation)
Turing (A Novel about Computation)
Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a...
Unconventional Computation: 10th International Conference, UC 2011, Turku, Finland, June 6-10
Unconventional Computation: 10th International Conference, UC 2011, Turku, Finland, June 6-10

The 10th International Conference on Unconventional Computation, UC 2011, was organized under the auspices of EATCS and Academia Europaea, by the Department of Mathematics of the University of Turku (Turku, Finland), and the Center for Discrete Mathematics and Theoretical Computer Science (Auckland, New Zealand). The event was held in...

25 Years of Model Checking: History, Achievements, Perspectives (Lecture Notes in Computer Science)
25 Years of Model Checking: History, Achievements, Perspectives (Lecture Notes in Computer Science)
Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and...
Computer Science: The Hardware, Software and Heart of It
Computer Science: The Hardware, Software and Heart of It

Computer Science: The Hardware, Software and Heart of It focuses on the deeper aspects of the two recognized subdivisions of Computer Science, Software and Hardware. These subdivisions are shown to be closely interrelated as a result of the stored-program concept. Computer Science: The Hardware, Software and Heart of It includes certain...

Alan Turing: His Work and Impact
Alan Turing: His Work and Impact

In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP, readers will find many of the most significant contributions from the four-volume set of the Collected Works of A. M....

Theory of Finite Automata With an Introduction to Formal Languages
Theory of Finite Automata With an Introduction to Formal Languages
It often seems that mathematicians regularly provide answers well before the rest of the world finds reasons to ask the questions. The operation of the networks of relays used in the first computers is exactly described by Boolean functions. George Boole thereby made his contribution to computer science in the mid-1800s, and Boolean algebra is used...
Black-Box Models of Computation in Cryptology
Black-Box Models of Computation in Cryptology

Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably restricted class of algorithms may be seen as support...

An Introduction to  Formal Languages and Machine Computation
An Introduction to Formal Languages and Machine Computation

This book provides an elementary introduction to formal languages and machine computation. The materials covered include computation-oriented mathematics, finite automata and regular languages, push-down automata and context-free languages, Turing machines and recursively enumerable languages, and computability and complexity. As integers are...

Hypercomputation: Computing Beyond the Church-Turing Barrier (Monographs in Computer Science)
Hypercomputation: Computing Beyond the Church-Turing Barrier (Monographs in Computer Science)
Hypercomputation is a relatively new theory of computation that is about computing methods and devices that transcend the so-called Church-Turing thesis. This book will provide a thorough description of the field of hypercomputation covering all attempts at devising conceptual hypermachines and all new promising computational paradigms that may...
Time and Petri Nets
Time and Petri Nets

At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many...

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