Learn IT - Books tags turing

Think Complexity: Complexity Science and Computational Modeling

O'Reilly, 2012

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...

Machine Intelligence 13: Machine Intelligence and Inductive Learning (Machine Intelligence)

Oxford University Press, 1994

Machine Intelligence 13 ushers in an exciting new phase of artificial intelligence research, one in which machine learning has emerged as a hot-bed of new theory, as a practical tool in engineering disciplines, and as a source of material for cognitive models of the human brain. Based on the Machine Intelligence Workshop of 1992, held at...

Time and Petri Nets

Springer, 2013

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...

An Introduction to 3D Computer Vision Techniques and Algorithms

John Wiley & Sons, 2009

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)

Springer, 2011

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

Springer, 2009

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

Springer, 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)

Pragmatic Bookshelf, 2013

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...

From Object-Orientation to Formal Methods: Essays in Memory of Ole-Johan Dahl (Lecture Notes in Computer Science)

Springer, 2004

This book is dedicated to the memory of Ole-Johan Dahl who passed away in June 2002 at the age of 70, shortly after he had received, together with his colleague Kristen Nygaard, the ACM Alan M. Turing Award:

"For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I...

New Computational Paradigms: Changing Conceptions of What is Computable

Springer, 2007

In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical...

Computer Viruses: from theory to applications (Collection IRIS)

Springer, 2005

This book deals with computer viruses envisaged from three different points of view, namely the theoretical fundamentals of computer virology, algorithmic and practical aspects of viruses and their potential applications to various areas. The theoretical formalization by means of Turing machines, self-reproducing automata and recursive functions...

A Second Course in Formal Languages and Automata Theory

Cambridge University Press, 2008

Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and...

Result Page: 6 5 4 3 2 1