Theories of Computability

Klappentext A mathematically sophisticated introduction to Turing's theory, Boolean functions, automata, and formal languages. Zusammenfassung This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability! but also a variety of other theories. Each topic is taken from the beginning and developed to a point at which the results can be appreciated. Inhaltsverzeichnis Preface; 1. Finite functions and relations; 2. Finite automata and their languages; 3. Grammars and their languages; 4. Computable functions and relations; References; Author index; Subject index; Math index.

Product details

• Authors: Nicholas Pippenger, Nicholas (University of British Columbi Pippenger, Pippenger Nicholas
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 10.06.2010
• EAN: 9780521153430
• ISBN: 978-0-521-15343-0
• No. of pages: 264
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries; MATHEMATICS / Logic, COMPUTERS / Machine Theory, Mathematical theory of computation, Mathematical logic