Skip to main content

Timeline for Is this number a prime?

Current License: CC BY-SA 3.0

7 events
when toggle format what by license comment
Jan 16, 2018 at 9:31 history edited Martin Ender CC BY-SA 3.0
update to Retina 1.0
Nov 10, 2017 at 5:24 comment added eaglgenes101 The most powerful "regex" engines out in the open right now have recognition power equal to that of a linear bounded automata. Standard issue regex, pattern recursion, unlimited lookhead, and unlimited lookbehind are all you need for context-sensitive parsing (though backreferences and such generally help with complicating efficient parsing), and some have them all. Don't even get me started on the engines that let you embed code into the regex.
Jun 28, 2017 at 7:11 history edited Martin Ender CC BY-SA 3.0
deleted 13 characters in body
Jun 28, 2017 at 7:11 comment added Martin Ender @PyRulez Most real-world regex flavours are a lot more powerful than the theoretical concept of regular expressions. I improved the wording though.
Jun 28, 2017 at 7:10 comment added Christopher King That's actually an irregular expression, since the primes do not form a regular language.
May 23, 2017 at 11:33 history edited CommunityBot
replaced http://stackoverflow.com/ with https://stackoverflow.com/
Sep 11, 2015 at 14:12 history answered Martin Ender CC BY-SA 3.0