When did we start to fetishize Turing completeness? Early computers generally did a computation and did not need general recursion.
-
-
Replying to @aaronmblevin
@aaronmblevin We've had jmp instructions for quite a while. The takeaway is how hard it is to *avoid* Turing completeness.2 replies 0 retweets 2 likes
Replying to @aaronmblevin
@aaronmblevin @a_cowley I've always enjoyed David Turner's paper on this, suggesting we should go the other way http://www.cs.kent.ac.uk/people/staff/dat/esfp/fple.pdf …
4:42 PM - 19 Mar 2015
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.