Artículos relacionados a Limits of Computation: From a Programming Perspective:...

Limits of Computation: From a Programming Perspective: 0 (Undergraduate Topics in Computer Science) - Tapa blanda

Libro 45 de 99: Undergraduate Topics in Computer Science

Reus, Bernhard

 
9783319278872: Limits of Computation: From a Programming Perspective: 0 (Undergraduate Topics in Computer Science)
Tapa blanda
ISBN 10: 3319278878 ISBN 13: 9783319278872
Editorial: Springer, 2016

Sinopsis

This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative.

Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles.  Numerous biographical footnotes about the famous scientists who developed the subject are also included.

"Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century. 

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

Acerca del autor

Dr. Bernhard Reus is a Senior Lecturer in the Department of Informatics at the University of Sussex, with 15 years experience in teaching computability and complexity.

De la contraportada

This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative.

Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles.  Numerous biographical footnotes about the famous scientists who developed the subject are also included.

"Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.

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

Editorial
Springer
Año de publicación
2016
Idioma
Inglés
ISBN 10 
3319278878
ISBN 13 
9783319278872
Encuadernación
Tapa blanda
Número de edición
1
Número de páginas
368
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania