From: sinu.nayak2001@gmail.com   
      
   Hi Bill,   
      
   Why do you think a stack based language shall not be turing complete?   
      
   You can get some ideas from   
   http://en.wikipedia.org/wiki/Esoteric_programming_language   
   http://en.wikipedia.org/wiki/Brainfuck   
   http://en.wikipedia.org/wiki/FALSE   
      
   "A Turing tarpit is a Turing-complete programming language whose   
   number of commands, operators, or equivalent objects is very small.   
   These include brainfuck (8 commands, all with 0 operands), OISC (1   
   command, 3 operands), and Thue (1 command, 2 operands)." - Wiki   
      
   Many stack based languages are turing complete.   
      
   Sincerely,   
   Srinivas Nayak   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)