Recursive Function Theory and Logic (Computer Science and Applied Mathematics)
| Author | : | |
| Rating | : | 4.17 (695 Votes) |
| Asin | : | 0127689508 |
| Format Type | : | paperback |
| Number of Pages | : | 338 Pages |
| Publish Date | : | 0000-00-00 |
| Language | : | English |
DESCRIPTION:
more information A Customer Here's the contents of the book: (haven't read it yet)introduction 1part 1 recursive function theorych 1 turing machines 151.1 the definition of a turing machine1.2 some simple problems tm's can do1.3 some terminology and notation1.4 the universal turing machine1.5 the halting problem1.6 a few remarks about decision problems1.7 well-known decision problems1.8 additional exercisesch 2 semi-thue a. not very good I've read a number of books on computability theory, and this isnt one of the good ones. It makes fluctuating demands on the level of mathematical sophistication required by the reader. Often trivial ideas are belabored, while more subtle and important concepts are glossed over. Even worse, many important theorems are left as poorly expressed exercises, or the reader is invited to hunt down a fo
paperback book with the name of Recursive Function Theory and Logic (Computer Science and Applied Mathematics) are written by Ann Yasuhara. it launch on 0000-00-00 and has 338 number of pages. Here, you can read it online or download on any other format as u want to.