Top Computing Theory Book Choices
Written by Kay Ewbank   
Monday, 23 March 2020
Article Index
Top Computing Theory Book Choices
For Students
Algorithms

The Computing Universe  

Author: Tony Hey and Gyuri Pápay
Publisher: Cambridge U P
Pages: 424
ISBN: 978-0521766456

Subtitled "A journey through a revolution", this book is targeted at students with the aim of stimulating their interest in “the wide range of career opportunities in computer science”, but Sue Gett thinks it would appeal to a wider audience and has given it five stars. She says the book is mostly highly accessible and when it is more difficult you are advised to skim, read or skip. A case in point is Chapter 6: Mr Turing's amazing machines, acknowledged in the preface as the most difficult in the book as it explores idea that are the theoretical basis for much of computer science. Other chapters cover algorithms, programming languages, hardware, the Internet, and artificial intelligence, all taking a route from the beginnings through to the present day.

 

Overall, Sue says that while it is intended to be intelligible to both high school and first-year university students, it has a lot to offer the general reader and even those already part of the computing universe as a coherent, well-written account of its past, present and future. Highly recommended.

Introduction to Computation and Programming Using Python

Author: John V Guttag
Publisher: MIT Press
Pages: 296
ISBN: 978-0262529624

This is the text book for the Introduction to Computer Science and Programming Using Python MOOC on edX, which is co-taught by its author John Guttag. As such, it is not a dummy's book and it isn't exclusively focused on teaching you to code in Python. This is a more general book on the ideas and practice of programming and algorithm construction - it also has a slightly academic feel to it, even though the style is casual and there are lots of encouraging words. It impressed Mike James enough for him to award it the maximum five stars.

The range of topics explored leans towards the statistics side of the science and it would make a good book for any student studying almost any STEM subject. Expect to learn as much about stats as computing as you progress. 

Since Mike reviewed the book, there's been a new edition updated for Python 3, reorganized to make it easier to use for courses that cover only a subset of the material, and with additions including expanded material on statistics and machine learning and new chapters on Frequentist and Bayesian statistics. As long as you are the right reader, this is the right book and comes Highly Recommended. 

A Concise Introduction to Languages and Machines 

Author: Alan P. Parkes
Publisher: Springer
ISBN: 978-1848001206

This is a book about the theory of formal languages, grammar and abstract machines such as the Turing machine, and Mike James said it’s the sort of material covered in any good computer science degree, and gave the book four stars, saying:

"What is special about this particular text book is that it attempts to introduce the very mathematical ideas of formal grammars and symbolic manipulation in a way that is easy to understand even if you don’t know much modern maths."

Mike said that by the end of the book the reader should be able to appreciate the big questions such as P=NP? and will be either ready to move on to something more advanced or will be better educated in the very basics of computational theory. He concluded that this is a good book but it isn’t suitable as a general non-technical introduction.

 

<ASIN:0521150183>

<ASIN:0262529629>

<ASIN:1848001207>

<ASIN: B081YS81L7>



Last Updated ( Tuesday, 24 March 2020 )