For the THEORETICAL COMPUTER SCIENTIST, calculability is the foundations that will lead to complexity considerations...For those liking a rigouros approach (for example with a mathematical background) , this book is just what they need...

MATHEMATICIANS should all find great pleasure in reading at least once in there life something about undecidable problems...(Yes there are some! ), and things such as: are real numbers just an illusion? etc...

People interested in the alternative "KLEEN FUNCTIONS" approach to calculability (instead of the classical TM approach or lambda calculus) will be delighted too...(Those accustumed with the TM approch will only like it more, but the book is absolutely complete in it's self...)