it's clever, I give you that. not fast, not memory efficient, but it is clever. I will keep this idea in my head, it looks like something that can be useful one day in another problem.
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Less computationally intense to just sort the letters into alphabetical order. eg. "angered" and "enraged" both map to "adeegnr" They used to publish anagram dictionaries based on this idea, so that people could cheat at Scrabble. https://en.wikipedia.org/wiki/Anagram_dictionary …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Should also work with sum of power of 2, that's the way we handle combination of unique flags in programming
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Would this work if you assign any number to a given letter, regardless if they are prime?
-
no. for example: let A=>2 and B=>4, then f(AA)=f(B) but AA and B are not anagrams.
End of conversation
New conversation -
-
-
This tweet and its comments are pure joy.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
This is nothing more than a one-hot encoding using Godel numbering. If you are in tech and have not read the works of Godel (incompleteness), Turing (computability), Church (lambda-calculus), and Kleene (all of the above), you have not yet seen true beauty in written form.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Anyone else notice that FEAR and FARE are anagrams, too? Just read F(EAR) and F(ARE) that way, before correcting myself.
-
Like DEAR and DARE; BEAR and BARE; REAR and RARE; (there are maybe a few more)
- 1 more reply
New conversation -
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.