20. Decide what machines can settle
Connect logic with algorithms through decidability, computability, Turing machines, Church’s thesis, and the halting problem. This chapter explains why some logical questions can be solved by procedure and others cannot.