





    New Computational Paradigms: Changing Conceptions of What is ComputableIn 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... 

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...   Computer Viruses: from theory to applications (Collection IRIS)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, selfreproducing automata and recursive functions...   A Second Course in Formal Languages and Automata TheoryIntended 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, contextfree languages, parsing and... 


Result Page: 6 5 4 3 2 1 