Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Computability and Logic
Авторы: Boolos G.S., Burgess J.P., Jeffrey R.C.
Аннотация:
This intermediate logic textbook for philosophy and computer science students introduces Gödel's completeness theorem, several incompleteness theorems, their attendant lemmas and corollaries, the theory of Turing machines, recursive functions, definability, and decidability.