Timeline for answer to Sandbox for Proposed Challenges by Kaya
Current License: CC BY-SA 3.0
Post Revisions
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 6, 2015 at 21:15 | history | wiki removed | Martin EnderMod | ||
| May 3, 2015 at 15:37 | history | made wiki | Post Made Community Wiki by Martin EnderMod | ||
| Sep 4, 2014 at 21:28 | history | post merged (destination) | |||
| Aug 27, 2014 at 1:47 | history | post merged (destination) | |||
| Jun 11, 2013 at 14:04 | comment | added | Kaya | Good call on the string inverse, yes you have the right idea and I will make it clear. I have a lot of test cases from when I did a number of these computations by hand in a university course and (anecdotal experience) I am pretty sure that it is possible to force the use of all the reduction rules (except maybe 4 which is really just a meta-rule for convenience when doing proofs). Additionally you have alerted me to some concerns regarding the form of the proper output: it's definitely underspecified. I'll put some work into this today. | |
| Jun 11, 2013 at 8:32 | comment | added | Peter Taylor |
It's also occurred to me that you haven't defined the notation M'. Does it just consist of toggling the orientation of each token, or does it also reverse the entire string? And do you have test cases which between them force implementation of all of the reduction rules?
|
|
| Jun 10, 2013 at 8:49 | comment | added | Peter Taylor | I don't think the order of explanation is correct. You should explain reduction before talking about "the reduced word". And "reduce it via reduction rules" doesn't entirely make sense, because the rules are presented as equivalences rather than reductions, and most of them don't have a "natural" direction. | |
| Jun 8, 2013 at 16:24 | history | edited | Kaya | CC BY-SA 3.0 |
added 10 characters in body
|
| Jun 8, 2013 at 16:21 | comment | added | Kaya | Yes, this is the case. In general however there is not a unique series of applications of the reduction rules for any given instance. | |
| Jun 8, 2013 at 14:33 | comment | added | PhiNotPi | If, for each input, there is only one correct output, then it should probably be code-golf. The scoring criteria would then be source code length. | |
| Jun 7, 2013 at 3:44 | history | edited | Kaya | CC BY-SA 3.0 |
added 209 characters in body
|
| Jun 7, 2013 at 3:37 | history | answered | Kaya | CC BY-SA 3.0 |