Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Undergraduate Topics in Computer Science Ser.: Models of Computation : An Introduction to Computability Theory by Maribel Fernández (2009, Trade Paperback)
B
Books From California (165451)
99.4% positive feedback
Price:
US $9.80
(inclusive of GST)
ApproximatelyS$ 12.61
+ $21.75 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherSpringer London, The Limited
ISBN-101848824335
ISBN-139781848824331
eBay Product ID (ePID)72393847
Product Key Features
Number of PagesXi, 184 Pages
LanguageEnglish
Publication NameModels of Computation : an Introduction to Computability Theory
Publication Year2009
SubjectSoftware Development & Engineering / General, Computer Science, Logic, Compilers
TypeTextbook
Subject AreaMathematics, Computers
AuthorMaribel Fernández
SeriesUndergraduate Topics in Computer Science Ser.
FormatTrade Paperback
Dimensions
Item Weight16 Oz
Item Length10 in
Item Width7 in
Additional Product Features
Intended AudienceScholarly & Professional
Dewey Edition22
ReviewsFrom the reviews: "The focus of this relatively short book is on newer object-oriented and interaction-oriented models, including recent work in quantum computing and systems biology. ... the book is designed for advanced undergraduate and graduate students. ... Each chapter starts by clearly indicating what will be covered and ends with a series of exercises. ... the book as a whole is extremely well written. Definitions are clearly stated ... . Each model of computation is precisely defined, and the examples are clear and to the point." (K. Harrow, ACM Computing Reviews, September, 2009) "It is a pleasure to see a book which takes a different approach to computer theory. ... This short book can be used for a one-term course ... . A valuable primer for students of programming languages. Summing Up: Highly recommended. Upper-division undergraduates and graduate students." (P. Cull, Choice, Vol. 47 (3), November, 2009), From the reviews:"The focus of this relatively short book is on newer object-oriented and interaction-oriented models, including recent work in quantum computing and systems biology. … the book is designed for advanced undergraduate and graduate students. … Each chapter starts by clearly indicating what will be covered and ends with a series of exercises. … the book as a whole is extremely well written. Definitions are clearly stated … . Each model of computation is precisely defined, and the examples are clear and to the point." (K. Harrow, ACM Computing Reviews, September, 2009)It is a pleasure to see a book which takes a different approach to computer theory. … This short book can be used for a one-term course … . A valuable primer for students of programming languages. Summing Up: Highly recommended. Upper-division undergraduates and graduate students. (P. Cull, Choice, Vol. 47 (3), November, 2009)
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal511.3
Table Of ContentTraditional Models of Computation.- Automata and Turing Machines.- The Lambda Calculus.- Recursive Functions.- Logic-Based Models of Computation.- Modern Models of Computation.- Computing with Objects.- Interaction-Based Models of Computation.- Concurrency.- Emergent Models of Computation.- Answers to Selected Exercises.
SynopsisA Concise Introduction to Computation Models and Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics. An in-depth analysis of the basic concepts underlying each model of computation is provided. Divided into two parts, the first highlights the traditional computation models used in the first studies on computability: - Automata and Turing Machines; - Recursive functions and the Lambda-Calculus; - Logic-based computation models. and the second part covers object-oriented and interaction-based models. There is also a chapter on concurrency, and a final chapter on emergent computation models inspired by quantum mechanics. At the end of each chapter there is a discussion on the use of computation models in the design of programming languages., This book provides an introduction to the essential concepts in computability, using several models of computation, from the standard Turing Machines and Recursive Functions, to the modern computation models inspired by quantum physics.
LC Classification NumberQA76.758
All listings for this product
Be the first to write a review
