# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

Most popular at the top

#### Die berechnete Welt (TELEPOLIS)

dpunkt.verlag 2013; US$ 11.44Auf dem Weg in die digitale Zukunft stehen wir heute an einer entscheidenden Weggabelung: Obwohl die Errungenschaften der digitalen Revolution natürliche Verbündete der Freiheit sind, stehen in jüngster Zeit Informatisierung und Technisierung unserer Welt dem ursprünglich verfolgten Freiheits- und Demokratisierungsgedanken immer häufiger entgegen.... more...

#### The EM Algorithm and Extensions

Wiley 2007; US$ 153.00The only single-source——now completely updated and revised——to offer a unified treatment of the theory, methodology, and applications of the EM algorithm Complete with updates that capture developments from the past decade, The EM Algorithm and Extensions, Second Edition successfully provides a basic understanding of the EM... more...

#### Essays in Constructive Mathematics

Springer New York 2007; US$ 129.00This book aims to promote constructive mathematics not by defining it or formalizing it but by practicing it. This means that its definitions and proofs use finite algorithms, not `algorithms' that require surveying an infinite number of possibilities to determine whether a given condition is met. The topics covered derive from classic works of... more...

#### Frege's Notations

Palgrave Macmillan 2012; US$ 95.00A new approach to reading Frege's notations that adheres to the modern view that terms and well-formed formulas are any disjoint syntactic categories. On this new approach, we can at last read Frege's notations in their original form revealing striking new solutions to many of the outstanding problems of interpreting his philosophy. more...

#### Genetic Algorithms and Genetic Programming

CRC Press 2009; US$ 99.95Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications discusses algorithmic developments in the context of genetic algorithms (GAs) and genetic programming (GP). It applies the algorithms to significant combinatorial optimization problems and describes structure identification using HeuristicLab as a platform for... more...

#### Handbook of Computability Theory

Elsevier Science 1999; US$ 200.00The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind... more...

#### Handbook of Proof Theory

Elsevier Science 1998; US$ 235.00This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics... more...

#### How to Think About Algorithms

Cambridge University Press 2008; US$ 40.00Textbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof. more...

#### The Lambda Calculus

Elsevier Science 2013; US$ 133.00The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications... more...

#### Lectures on the Curry-Howard Isomorphism

Elsevier Science 2006; US$ 170.00The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic... more...