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 ...Cały opis
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.
SZEROKI WYBÓR
Oferujemy ponad milion pozycji anglojęzycznych – od literatury pięknej po specjalistyczną .
DARMOWA WYSYŁKA
Darmowa wysyłka do Paczkomatu od 299 zł.
ATRAKCYJNE CENY
Staramy się by ceny książek były na jak najniższym poziomie, zawsze poniżej ceny zalecanej przez wydawcę. Wszystko po to, by każdy mógł sobie pozwolić na zakup.
14 DNI NA ZWROT
Zakupione u nas książki możesz zwrócić do 14 dni, bez podawania powodów. Wystarczy nas o tym poinformować drogą e-mailową i odesłać książki pod nasz adres, a my zwrócimy pieniądze.