Mathematical Structures for Computer Science Review

Average Reviews:

(More customer reviews)This book will leave you high and dry on many occassions. Gersting explains the obvious in each section with her practice problems and then throws problems that are impossible to do without an extra book at the end of each section. Unless you have a very good professor that notices and makes up for the grey areas in this book, you are in big trouble my friend. Discrete Math is a fun subject, this book makes it a total hassle.

Click Here to see more reviews about: Mathematical Structures for Computer Science

Computing Curricula 2001 (CC2001), a joint undertaking of the Institute for Electrical and Electronic Engineers/Computer Society (IEEE/CS) and the Association for Computing Machinery (ACM), identifies the essential material for an undergraduate degree in computer science.This Sixth Edition of Mathematical Structures for Computer Science covers all the topics in the CC2001 suggested curriculumfor a one-semester intensive discrete structures course, and virtually everything suggested for a two-semester version of a discrete structures course. Gersting's text binds together what otherwise appears to be a collection of disjointed topics by emphasizing the following themes: ' Importance of logical thinking' Power of mathematical notation' Usefulness of abstractions

Click here for more information about Mathematical Structures for Computer Science

Read More...

Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) Review

Average Reviews:

(More customer reviews)This text was specifically written to replace Rogers as the standard graduate introduction. As you will see if you ask around, it wasn't completely successful. That is because, while Rogers is creaking with age, it is interesting. This book is not. It is a detailed and orderly presentation of what the author thinks is important, but that does not include any context, motivation, relations to other math, or applications. It is painfully dull. (There is a 2e in the works, but the excerpts I saw were about the same.) Also, it starts very fast and will be confusing if you haven't already done a book like Cutland. I think the problem is that he has been a master of the subject for so long that he can't put himself in the mind of someone coming to the material for the first time.

Click Here to see more reviews about: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)

The first part consists of an introduction to the theory of computation and recursive function theory, including definitions of computable functions, Turing machines, partial recursive functions, recursively enumerable sets, the Kleene recursion theorem etc. The second part is a comprehensive study of recursively enumerable sets and their degrees.

Click here for more information about Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)

Read More...