




Computability: Turing, Gödel, Church, and Beyond
In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations into the foundations of mathematics. In the...     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 selfcontained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of... 


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


Result Page: 6 5 4 3 2 1 