Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction to theories of computability. It treats not only "the" theory of computability (the theory created b ...Celý popis
Broad in coverage, mathematically sophisticated, and up to date, this book provides an introduction to theories of computability. It treats not only "the" theory of computability (the theory created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages) as theories of computability. These are addressed from the classical perspective of their generation by grammars and from the more modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account, written by one of the leading lights of the subject, will be required reading for graduate students and researchers in theoretical computer science and mathematics.
Proč nakupovat na Enbooku?
Velký výběr
Nabízíme miliony knih v angličtině. Od beletrie až po ty nejodborněji odborné.
Poštovné zdarma
Poštovné už od 54 Kč a při objednávce nad 1499 Kč doprava na pobočku Zásilkovny zdarma.
Skvělé ceny
Ceny knih se snažíme držet při zemi a vždy pod cenou doporučovanou vydavatelem, aby si je mohl koupit opravdu každý.
Online podpora
Můžete využít online chatu, emailu nebo nám zatelefonovat.
Osobní přístup
Nejdůležitější je pro nás Vaše spokojenost. Prodáváme knihy, protože je milujeme. Nejsme žádní nadnárodní giganti, ale poctivá česká firma.