Texts in computer science - 9781461264200 - a recursive introduction to the theory of computation di smith, carl (19 risultati)

Condizione: New.

Paperback or Softback. Condizione: New. A Recursive Introduction to the Theory of Computation. Book.

Paperback. Condizione: New. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped. Softcover reprint of the original 1st ed. 1994.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. In.

Paperback. Condizione: New.

Condizione: New.

Condizione: New. pp. 160.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Brand New. 156 pages. 9.02x5.98x0.37 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Condizione: Neu. A Recursive Introduction to the Theory of Computation | Carl Smith | Taschenbuch | Texts in Computer Science | viii | Englisch | 2012 | Springer | EAN 9781461264200 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 160 pp. Englisch.…

Condizione: New. Print on Demand pp. 160 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 160.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.…

Taschenbuch. Condizione: Neu. 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 KG, Sachsenplatz 4-6, 1201 Wien 160 pp. Englisch.…