Re:Makefile Assignments are Turing-Complete
by Avshalom on Tuesday May 03, 2016 @08:39AM
(#11620002)
It's like claiming my computer isn't turing complete because it only has 8 gigs of ram instead of infinity. I mean pedantically nothing is actually turing complete because the universe is finite. In this case you just have to write a sufficiently large grid, a 40x40 grid isn't required by the technique it's just how big this one was written.
[ Parent
| on HN ]
There are no comments on this comment yet.