News for hackers. Stuff that matters.
Re:Makefile Assignments are Turing-Complete by Sharlin on Tuesday May 03, 2016 @05:57AM (#11619183)
The point is that, as mentioned in the article, the POSIX make spec is positively barren! Indeed, this is another example of very simple substitution systems turning out to be emergently Turing complete.
Re:Makefile Assignments are Turing-Complete by d33 on Tuesday May 03, 2016 @06:18AM (#11619267)
So you'd say that it's a good thing? How is hidden complexity good?
Re:Makefile Assignments are Turing-Complete by Sharlin on Tuesday May 03, 2016 @06:49AM (#11619428)
It's not necessarily a good thing. It's definitely interesting, though. It's difficult to come up with systems that are simultaneously useful and don't have emergent complexity - and it's not clear to me if it's worth the effort to even try in the general case!

For what it's worth, in my opinion build systems should definitely be intentionally, not accidentally, Turing complete.

Re:Makefile Assignments are Turing-Complete by Avshalom on Tuesday May 03, 2016 @08:44AM (#11620045)
Eh, you pretty much have to specifically design systems to avoid turing completeness. It's a hilariously low bar to clear.