Timeline for NESCA: New English Stroke Count Alphabet
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2020 at 23:23 | comment | added | Arnauld | @Sumner18 To give you an idea of how bad it would be, here is some JS code that only computes the correct permutation. | |
| Nov 16, 2020 at 23:15 | comment | added | Adamátor | @Sumner18 It wouldn't make sense in practical languages. In order for this approach to save bytes, it needs the language to have compressed number literals, a built-in for the alphabet and a built-in for indexing permutations. | |
| Nov 16, 2020 at 23:06 | comment | added | Sumner18 | @Arnauld Could that be translated to other languages? I see most other examples, like your JavaScript solution, are just hard coding the NESCA into the solution, which is fine, but I'm just imagining the possibilities. | |
| Nov 16, 2020 at 22:58 | comment | added | Arnauld |
@Sumner18 Jelly has a built-in that does exactly that: Œ¿ is essentially the inverse of Œ?.
|
|
| Nov 16, 2020 at 22:53 | comment | added | Sumner18 | How did you find that permutation number? That's insane! Have an upvote! | |
| Nov 16, 2020 at 22:39 | history | edited | Adamátor | CC BY-SA 4.0 |
added 1019 characters in body
|
| Nov 16, 2020 at 22:30 | history | edited | Adamátor | CC BY-SA 4.0 |
added 457 characters in body
|
| Nov 16, 2020 at 22:20 | history | answered | Adamátor | CC BY-SA 4.0 |