Timeline for Is pure pattern matching without PatternTest and Condition Turing-complete?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot | replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/ | |
| Sep 3, 2012 at 15:44 | answer | added | WReach | timeline score: 6 | |
| May 26, 2012 at 20:43 | comment | added | a06e | The basic operations (union, concatenation and Kleene star) that make regular expressions are all reproducible with patterns. It follows that patterns recognize regular expressions. The question is whether patterns can recognize all recursively enumerable languages, which is the set of langauges definable by Turing Machines. | |
| May 2, 2012 at 17:35 | comment | added | celtschk | @R.M: No, that's not a pattern, but an operation using patterns. Basically, you should be able to "run" the pattern by writing MatchQ[yourInput,HoldPattern[yourPattern]]. | |
| May 2, 2012 at 15:58 | comment | added | rm -rf♦ | do you allow the use of ReplaceRepeated? | |
| May 2, 2012 at 5:46 | comment | added | StackExchanger | You might find Norman Ramsey's response in this thread quite helpful: What are practical guidelines for evaluating a language's “Turing Completeness”? | |
| Apr 30, 2012 at 22:41 | comment | added | Mr.Wizard | The questions on this site are increasingly esoteric. I have no answer for your strange yet interesting question. | |
| Apr 30, 2012 at 17:13 | history | tweeted | twitter.com/#!/StackMma/status/197010818456502272 | ||
| Apr 30, 2012 at 15:03 | history | edited | rm -rf♦ | CC BY-SA 3.0 | edited tags; edited title |
| Apr 30, 2012 at 14:19 | history | edited | rcollyer | CC BY-SA 3.0 | spelling |
| Apr 30, 2012 at 14:12 | history | asked | celtschk | CC BY-SA 3.0 |