Artículos relacionados a A Recursive Introduction to the Theory of Computation...

A Recursive Introduction to the Theory of Computation (Texts in Computer Science) - Tapa blanda

Libro 25 de 83: Texts in Computer Science

Smith, Carl

 
9781461264200: A Recursive Introduction to the Theory of Computation (Texts in Computer Science)
Tapa blanda
ISBN 10: 1461264200 ISBN 13: 9781461264200
Editorial: Springer, 2012

Sinopsis

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms. From there the book considers the complexity of computations and the notion of a complexity measure is introduced. Finally, the book culminates in considering time and space measures and in classifying computable functions as being either feasible or not. The author assumes only a basic familiarity with discrete mathematics and computing, making this textbook ideal for a graduate-level introductory course. It is based on many such courses presented by the author and so numerous exercises are included. In addition, the solutions to most of these exercises are provided.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2012
Idioma
Inglés
ISBN 10 
1461264200
ISBN 13 
9781461264200
Encuadernación
Tapa blanda
Número de páginas
160
Contacto del fabricante
GPSR Kontakt
ProductSafety@springernature.com

Tiergartenstr. 17
Heidelberg
69121
Alemania