RG <rnospa...@flownet.com> writes: > There are only two possibilities: either you have a finite-state > machine, or you have a Turning machine. (Well, OK, you could have a > pushdown automaton, but there are no programming languages that model a > PDA. Well, OK, there's Forth, but AFAIK there are no static type > checkers for Forth.
http://home.vrweb.de/stephan.becher/forth/ > Besides, who uses Forth? ;-) news:comp.lang.forth (JFYI, Forth has at least 2 stacks, thus it is equivalent to Turing Machine.) -- HE CE3OH... -- http://mail.python.org/mailman/listinfo/python-list
