Programming Methodology, Computer Mathematics, Mathematical Programming & Operations Research, Machine Theory
Available on Bookshop
Write a review
Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Log in to track your reading progress.
Overview
This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only the theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). Particular attention is given to the underlying mathematical structures. Each topic is taken from the beginning and developed to a point at which the most recent results can be appreciated. This authoritative, up-to-date account by one of the leading lights of the subject will be required reading for graduate students researchers in theoretical computer science and mathematics.Book Details
Published
June 1, 2010
Publisher
Cambridge University Press
Pages
264
Format
Paperback
ISBN
9780521153430