This specific ISBN edition is currently not available.View all copies of this ISBN edition:
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.
Book Description Condition: New. New. Seller Inventory # E-0387943323
Book Description Condition: New. New. Seller Inventory # S-0387943323
Book Description Springer, 2017. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2017; Fast Shipping from the UK. No. book. Seller Inventory # ria9780387943329_lsuk
Book Description Springer, 1994. Hardcover. Condition: New. 1994. Seller Inventory # DADAX0387943323
Book Description Springer, 1994. HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780387943329
Book Description Springer 1994-10-14, 1994. Hardcover. Condition: New. Seller Inventory # 6666-ING-9780387943329