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.
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.
"About this title" may belong to another edition of this title.
£ 2.74 shipping within United Kingdom
Destination, rates & speedsSeller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-U-003-01971
Quantity: 1 available
Seller: Gulf Coast Books, Cypress, TX, U.S.A.
hardcover. Condition: Fair. Seller Inventory # 0387943323-4-32770386
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: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 671507-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780387943329_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 671507
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
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 940. Seller Inventory # C9780387943329
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: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 671507-n
Quantity: Over 20 available