You can see the ToC here: <a href="https:&#x2F;&#x2F;dl.acm.org&#x2F;citation.cfm?id=1095587" rel="nofollow">https:&#x2F;&#x2F;dl.acm.org&#x2F;citation.cfm?id=1095587</a><p>Chapter 3 talks about McCulloch-Pitts.<p>I remember being impressed with chapter 14 (&quot;very simple bases for computability&quot;) as a kid. Finding UTMs with minimal number of states etc. are great riddles. I also  fondly remember the discussion of the halting problem and related problems (&quot;does program P output X&quot;) in chapter 8. This was my first introduction to this procedure and Minsky made the idea of reducing one problem to another totally straightforward. Many years later I realized that not a few CS students find these ideas confusing.