I was reading Alan Turing's paper "On Computable Numbers with an Application to the Entscheidungsproblem".
I was reading well until I encountered "4. Abbreviated Tables", page 235-236, where Turing uses a new way of writing a computation table for a machine. I am totally lost here. I don not understand the examples he gives (starting from page 236) to explain the idea of skeleton tables.
I need help with understanding how skeleton tables are to be read, and what they mean.