ISBN: 9780387943329 - a recursive introduction to the theory of computation (16 risultati)

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condizione: Sehr gut. 156 p. In very good condition. ISBN: 9780387943329 Sprache: Englisch Gewicht in Gramm: 420 15,2 x 1,3 x 22,9 cm, hardcover.

Cloth. Condizione: Near Fine to Fine. Condizione sovraccoperta: Published Without Dust Jacket. 148 pp. Tightly bound. Corners not bumped. Text is free of markings. No ownership markings.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. pp. 164.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. 164 9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam.

Condizione: New.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Buch. 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. 172 pp. Englisch.…

Gebunden. 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.…

Condizione: New. PRINT ON DEMAND pp. 164.

Buch. Condizione: Neu. nach der Bestellung gedruckt 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.…

Buch. 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.…