Normal view MARC view ISBD view

Complexité et décidabilité / Patrick Dehornoy

Auteur principal : Dehornoy, Patrick, 1952-2019, AuteurType de document : MonographieCollection : Mathématiques et applications, 12Langue : français.Pays : France.Éditeur : Paris : Springer, 1993Description : 1 vol. (200 p.) ; 24 cmISBN : 2287004165.ISSN : 1154-483X.Bibliographie : Bibliogr. p. 195-197. Index.Sujet MSC : 03D15, Computability and recursion theory, Complexity of computation (including implicit computational complexity)
03D10, Computability and recursion theory, Turing machines and related notions
03B25, General logic, Decidability of theories and sets of sentences
68Q04, Theory of computing, Classical models of computation (Turing machines, etc.)
68Q15, Theory of computing, Complexity classes (hierarchies, relations among complexity classes, etc.)
En-ligne : Zentralblatt | MathSciNet
Tags from this library: No tags from this library for this title. Log in to add tags.
Current location Call number Status Date due Barcode
CMI
Couloir
Séries SMA (Browse shelf) Available 10948-01
CMI
Couloir
Séries SMA (Browse shelf) Available 10948-02

Bibliogr. p. 195-197. Index

This book is the supporting text of the course taught by the author at the University of Caen. It includes main results in complexity theory concerning first-order logic. The author emphasizes on the main negative results concerning the complexity of Boolean calculus, first-order logic and of arithmetic. The theory is presented in the standard model of Turing machines. The model is largely studied in the first six chapters of the book. Thus, the reader may not be familiar with complexity and even logic theories. We note the elegant manner the author succeeds in giving a rigorous and at the same time easy to understand presentation of some difficult results.

Here are the chapters of the book: 1. Algorithmes et machines de Turing, 2. Simulation d’algorithmes, 3. Changement de réprésentation, 4. Fonctions récursives, 5. Machines universelles, 6. Machines non déterministes, 7. Complexité du calcul booléen, 8. Complexité des logiques du premier ordre, 9. Complexité de l’arithmétique, 10. Complexité de l’addition des entiers. (Zentralblatt)

There are no comments for this item.

Log in to your account to post a comment.