Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • 4
    \$\begingroup\$ I never thought of regex as a programming language but I guess it is one? For sure not a Turing complete one though... \$\endgroup\$ Commented Jan 24, 2020 at 8:08
  • 22
    \$\begingroup\$ Did you post this challenge just so you could post this solution?! \$\endgroup\$ Commented Jan 24, 2020 at 21:39
  • 3
    \$\begingroup\$ @Shaggy I wouldn't have had the idea otherwise. Explained in the original sandbox post. \$\endgroup\$ Commented Jan 25, 2020 at 6:32
  • 10
    \$\begingroup\$ @findusl It's certainly not Turing complete. Its power rests somewhere below primitive recursive, but exactly where hasn't really been pinned down. With unlimited scratch space it would be exactly primitive recursive; it's the extra limit of having to work within the input's space that changes this. \$\endgroup\$ Commented Jan 25, 2020 at 6:34