Proofs and Algorithms by Gilles Dowek
This volume provides an introduction to the fundamental concepts of logic. Written for those new to the field, the text covers both elementary topics -- proofs, models, recursive functions, etc. -- as well as more advanced principles.-
Modelling Computing Systems
-
Sets, Logic and Maths for Computing
-
Principles of Digital Image Processing
-
Introduction to Artificial Intelligence
-
A First Introduction to Quantum Computing and Information
-
Introduction to Data Science
-
A Practical Approach to Compiler Construction
-
A Concise Introduction to Languages and Machines
-
Fundamentals of Discrete Math for Computer Science
-
Data Structures and Algorithms with Python
-
A Beginners Guide to Python 3 Programming
-
Philosophical and Cultural Aspects of Computing
-
Principles of Data Mining
-
Pattern Recognition
-
Introduction to Deep Learning
-
Financial Software Engineering
-
Guide to Competitive Programming
-
Advanced Guide to Python 3 Programming
-
Introduction to Medical Image Analysis
-
Introduction to Video and Image Processing
-
Introduction to Software Quality
-
Multicore Programming Using the ParC Language
-
Introduction to HPC with MPI for Data Science
-
Computability and Complexity
-
Object-Oriented Programming Languages: Interpretation
-
Introduction to Parallel Computing
-
Concise Guide to Databases
-
Human-Centred Scientific Data Visualisation
-
Guide to Using Generative AI in Programming
-
Programming in HTML and PHP
-
Introduction to Cryptographic Definitions
-
Introduction to Software Process Improvement
-
Rigorous Software Development
-
Sensing and Systems in Pervasive Computing
-
Autonomic Computing
-
OCaml Scientific Computing
-
Applied Logic for Computer Scientists
-
Basic Graph Theory
From the reviews:
“This work examines when the application of an algorithm can replace the construction of a proof… focuses on establishing that provability is undecidable in predicate logic (Church’s theorem). The text generally consists of propositions followed by proofs, with commentary, examples, and exercises interspersed. … The book would be of interest to those with adequate background. Summing Up: Recommended. Graduate students and above.” (J. R. Burke, Choice, Vol. 49 (1), September, 2011)
“Mathematical logic is a challenging subject for many students. … this book, with its focus on the nature of proofs and algorithms and their relationship, appears to be targeted precisely for such an audience and should appeal to computer scientists and philosophers … . this book remains an introductory book on mathematical logic suited for a beginning graduate course in logic. … Its conciseness makes it well suited for a one-semester graduate course.” (Burkhard Englert, ACM Computing Reviews, February, 2012)
Gilles Dowek is a mathematician, logician, and computer scientist who works at INRIA, France's National Institute for Computer Science and Automation. He is a member of the Société informatique de France's scientific board as well as CERNA's. He also works as a consultant with the National Institute of Aeronautics, a NASA-affiliated research facility. For his efforts in popular science, he was awarded the Grand Prize d'Alembert des Lycéens by the French Mathematical Society.
| SKU | Unavailable |
| ISBN 13 | 9780857291202 |
| ISBN 10 | 0857291203 |
| Title | Proofs and Algorithms |
| Author | Gilles Dowek |
| Series | Undergraduate Topics In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer London Ltd |
| Year published | 2011-01-14 |
| Number of pages | 156 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |