A Recursive Introduction to the Theory of Computation

Carl Smith

ISBN 10: 1461264200 / ISBN 13: 9781461264200

Verlag: Springer New York, Springer New York Nov 2012, 2012

Beschreibung

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.

Bestandsnummer des Verkäufers 9781461264200

Bibliografische Details

• Titel: A Recursive Introduction to the Theory of Computation
• Verlag: Springer New York, Springer New York Nov 2012
• Erscheinungsjahr: 2012
• Sprache: Englisch
• ISBN-10: 1461264200
• ISBN-13: 9781461264200
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

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.