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 ]
There are no comments on this comment yet.