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.
"synopsis" may belong to another edition of this title.
Shipping:
FREE
Within U.S.A.
Seller: Gulf Coast Books, Memphis, TN, U.S.A.
hardcover. Condition: Fair. Seller Inventory # 0387943323-4-32770386
Quantity: 1 available
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_243765045
Quantity: 1 available
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Seller Inventory # 15933481-20
Quantity: 1 available
Seller: Wissenschaftl. Antiquariat Th. Haker e.K, Klettgau, Germany
Condition: 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. Seller Inventory # 59390
Quantity: 1 available
Seller: Book Bear, West Brookfield, MA, U.S.A.
Cloth. Condition: Near Fine to Fine. 148 pp. Tightly bound. Corners not bumped. Text is free of markings. No ownership markings. Seller Inventory # 024011
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580174023
Quantity: Over 20 available
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Hardback or Cased Book. Condition: New. A Recursive Introduction to the Theory of Computation 0.85. Book. Seller Inventory # BBS-9780387943329
Quantity: 5 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780387943329
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780387943329_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: 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. Seller Inventory # 9780387943329
Quantity: 2 available