On Thursday, March 15, 2012 7:00:10 PM UTC+1, rjf wrote: > > To address this issue more specifically, the complexity of a grammar does > not reflect the entire complexity of a language. >
yes, i wasn't implying that this is the solve measurement, but i think it is part of it. mathematica's grammar might be real fun! > Norvig > because you mention him, he is teaching "design of computer programs" at this udacity online university. http://www.udacity.com/overview/Course/cs212 i'll try to follow it, he is certainly a good guy to deliver some key insights into this whole babylonian tower of programming languages. h -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
