The first complete and open source implementation of Alan Turing's famous paper - On Computable Numbers, with an Application to the Entscheidungsproblem.
About a month ago I attempted to read Turing's paper, and found it too difficult to understand. I figured reading a reference implementation (that includes m-functions, a working univeral machine, etc.) would make things clearer. It was super surprising to find that a full implementation does not exist on the internet, so I decided to write my own.
For those who intend to read the full paper I recommend starting with The Annotated Turing by Charles Petzold (which explains the paper line-by-line with annotations).
I wrote a section-by-section guide (GUIDE.md) that explains the paper in the context of this codebase. My hope is that the combination of a reference implementation and walkthrough helps others get value from the paper like I did.