
 LtU Classic Archives 
  Turing completeness is oriented towards functions from input to output, while more or less ignoring interaction, time, trust, fairness. 
  However, broadly interpreted Turingcompleteness doesn't have anything to do with Turing machines, but rather computability itself, and so we are not talking only about a translation to Turing machines, but also anything else, like the untyped lambdacalculus or Milner's picalculus, which has the same computational power. 
  The equivalence of all these computational models, though, means basically that, even though Turing machines don't explicitly deal with interaction or fairness or whatever, they can be dealt with indirectly by encoding. 
 lambdatheultimate.org /classic/message12481.html (1862 words) 
