
Sách keo gáy, bìa mềm
Thể loại:Computers - Computer Science
Năm:2001
In lần thứ:2nd ed
Ngôn ngữ:english
Trang:537
This entire subject is very difficult. I suppose that i wouldn't know
that this book was bad if i hadn't read better?Computability: An
Introduction to Recursive Function Theory for instance, uses much more
understandable language and symbols. In most cases books in this area of
language and automata theory are difficult, but most authors realize
this and try to make the text more understandable. I suppose if this
were a text for a class I'd be faced with trying to find a Schaum's
outline text to get me through the course? In other words the text is a
failure that seems to be difficult for even people who are familiar with
the material. My heart goes out to students who have only this text for
their class: an instructor that choses such a text will be no help in
his lectures?