Descargar AudioLibro Computability: An Introduction to Recursive Function Theory de N. J. Cutland

Descargar AudioLibro Computability: An Introduction to Recursive Function Theory de N. J. Cutland año 1997

Ficha completa del audiolibro


  • Nombre del audiolibro: Computability: An Introduction to Recursive Function Theory
  • Autor del audiolibroN. J. Cutland
  • Fecha de publicación: 12/9/1997
  • IdiomaInglés
  • Género o ColecciónInformática
  • ISBN: 9780521294652
  • Valoración del audiolibro: 8.84 de un máximo de 10
  • Votos: 525
  • Autor(a) de la reseña: Cenobia Lazaro
  • Reseña valorada con una puntuación de 9.98 de un máximo de 10
  • Fecha reseña: 9/8/2018
  • Duración: 3 horas con 8 minutos (125.5 MB)
  • Fecha creación del audiolibro: 18/05/2018
  • Puedes escuchar el audiolibro en estos formatos: OGG - MPEG4 - WMA - FLAC - MPC - WAV - ATRAC - MP3 (compresión TGZ - ZIP - TAR.XZ - DEB - ISO - RAR)
  • Incluye un resumen PDF de 30 páginas
  • Duración del resumen (audio): 23 minutos (15 MB)
  • Servidores habilitados: Torrent Project - FileServe - Hotfile - Dropbox - Microsoft OneDrive - Google Drive - Torrent Funk - BitShare - SpiderOak
  • Encuadernación del libro físico: Tapa Blanda
  • Descripción o resumen: What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel’s incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

Quiero bajar el audiolibro en el idioma:


Otros audiolibros en el idioma Inglés

Otros audiolibros del género o colección Informática