The Wiert Corner – irregular stream of stuff

Jeroen W. Pluimers on .NET, C#, Delphi, databases, and personal interests

  • My badges

    Mastodon

  • Twitter Updates

  • My Flickr Stream

    20140508-Delphi-2007--Project-Options--Cannot-Edit-Application-Title-HelpFile-Icon-Theming20140430-Fiddler-Filter-Actions-Button-Run-Filterset-now20140424-VMware-Fusion-6.0.3.-no-reclaimable
    More Photos

  • Pages

  • All categories

  • Enter your email address to subscribe to this blog and receive notifications of new posts by email.

    Join 1,860 other subscribers
«
»

Makefile Assignments are Turing-Complete « null program

Posted by jpluimers on 2017/06/01

The picture tricked me into thinking it was a Makefile for Tic-Tac-Toe, but it is in fact a 174 kilobyte makefile for Conways’ game of life which proofs that make macros are Turing complete.

Source: Makefile Assignments are Turing-Complete « null program

via: Abusing POSIX make to implement Conway’s game of life to demonstrate that make macros are Turing complete, even if there are no if and loop macros. – Kristian Köhntopp – Google+

While running on my Mac, the recursivity will make it fail on lack of resources though.

If seen both these:

sleep: Resource temporarily unavailable

and

make[119]: /bin/sh: Resource temporarily unavailable
make[119]: *** wait: No child processes. Stop.
make[119]: *** Waiting for unfinished jobs....
make[119]: *** wait: No child processes. Stop.

 

–jeroen

This entry was posted on 2017/06/01 at 06:00 and is filed under Development, Makefile, Scripting, Software Development. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.

«
»