Programming Discussion Thread

[AnyOldName3]

Lambda calculus is at its heart an incredibly simplified macro expansion system, and that was approximately the first thing to be shown to be Turing-complete (as it was probably the first thing to be shown to be equivalent to a Turing machine). Turing completeness can come from very simple places.