Path: csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!news.linkpendium.com!news.linkpendium.com!news.snarked.org!newsfeed.news.ucla.edu!usenet.stanford.edu!usenet.osg.ufl.edu!news.lightlink.com!news.iecc.com!nerds-end From: Srinivas Nayak Newsgroups: comp.compilers Subject: Re: Language Design Date: Mon, 18 Jul 2011 22:54:33 -0700 (PDT) Organization: Compilers Central Lines: 19 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <11-07-030@comp.compilers> References: <11-07-027@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: gal.iecc.com 1311403071 67176 64.57.183.58 (23 Jul 2011 06:37:51 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Sat, 23 Jul 2011 06:37:51 +0000 (UTC) Keywords: design, theory Posted-Date: 23 Jul 2011 02:37:50 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: x330-a1.tempe.blueboxinc.net comp.compilers:206 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