
 Comments on 14482  Ask MetaFilter (Site not responding. Last check: 20071012) 
  Now, the neat thing is that a Turing Machine is one of the things that can be "calculated", which is to say, a Turing Machine can be programmed to simulate a Turing Machine. 
  Turing machines don't directly support the first, for instance, and the lambda calculus doesn't support any of the requirements directly. 
  Oh, and by the way, Postscript and TeX are both turing complete, in case someone wants to use text formatting languages to solve the worlds problems. 
 ask.metafilter.com /mefi/14482 (2650 words) 
