Re:A regular expression to check for prime numbers
by philh on Sunday July 04, 2010 @06:35PM
(#1486554)
I don't disagree. But the programmers have "regexes" which refers unambiguously to their type of "regular expression"; there's no good equivalent for a CS theorist. (A regular language is not a regular expression, just like the set of prime numbers is not a test for primality.)
[ Parent
| on HN ]
There are no comments on this comment yet.