News for hackers. Stuff that matters.

A comment on Makefile Assignments are Turing-Complete. Parent comment

Re:Makefile Assignments are Turing-Complete by dozzie on Tuesday May 03, 2016 @07:31AM (#11619605)
> Doesn't Turing completeness require the ability to modify an arbitrary amount of memory?

Why would it? Lambda calculus is nothing about modifying anything.

And GNU make (though with GNU extensions) is certainly Turing-complete: https://github.com/shinh/makelisp

[ Parent | on HN ]
Re:Makefile Assignments are Turing-Complete by Sharlin on Tuesday May 03, 2016 @07:45AM (#11619674)
In case of lambda calculus the equivalent condition is being able to evaluate arbitrarily large expressions. This sort of a Makefile-based evaluator could only do strings up to some hardcoded finite length.
[ Parent | on HN ]