[
Lists Home |
Date Index |
Thread Index
]
> > Try and implement everything in declarative grammers is impossible.
Not *technically* true (for reasonable values of 'everything'). They can
be Turing-complete.
ABS
--
Alaric B. Snell
http://www.alaric-snell.com/ http://RFC.net/ http://www.warhead.org.uk/
Any sufficiently advanced technology can be emulated in software
|