Computability: An Introduction to Recursive Function Theory

Cutland, Nigel J.

Ouvrage indisponible

Éditeur
Cambridge University Press
Pages
264
Parution
juin 1980
Format
Livre broché
Langue
Anglais
Dimensions
228 × 152 × 15 cm
EAN
9780521294652
  • Résumé

This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation.
Bio de l'auteur
Sommaire / contenu
Nous vous suggérons aussi
Introduction to Statistical Learning, An: With Applications in R James, Gareth Hastie, Trevor Tibshirani, Robert Witten, Daniela
Exercises and Solutions in Statistical Theory Kupper, Lawrence L. Neelon, Brian H. O'Brien, Sean M.
Retour en haut de page