✅ Poštovné ZADARMO nad 39€ ✅ Knižná akcia každý mesiac ✅ Výhodné ceny ✅ Bezpečný nákup
Viac o knihe Computability and Logic (George S. Boolos, John P. Burgess, Richard C. Jeffrey)
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
Rok vydania:
2007ISBN:
9780521701464Rozmer:
180×250 mmPočet strán:
366Väzba:
brožovanáJazyk: angličtina
