[Home] [By Thread] [By Date] [Recent Entries]
On Wed, 13 Feb 2002, John Cowan wrote: > That means that they are not equivalent in *convenience*. > When I say they are equivalent in power, I mean it in the > same sense that assembly language and Prolog are said to be equivalent > in power: they are both Turing-complete. Noooo! I knew it'd come to this. ABS
|

Cart



