• @[email protected]
        5•29 days ago

        Oh boy, they have some good ones. You’ve been missing out.

        Edit: Quicksort has a nice one. SVD for linear/matrix operations too.

        I’m pretty sure I’ve seen even better ones that could almost stand as a YouTube video but I can’t remember where now

    • @Imgonnatrythis
      9•29 days ago

      I love that the word ambigram can be made to look as an ambigram whereas palindrome - wtf, could have done so much better with naming that guys.

      • @[email protected]
        12•29 days ago

        hippopotomonstrosesquipedaliophobia (Fear of long words) was clearly not defined by anyone suffering from the phobia either.

  • @xmunk
    53•29 days ago

    This is an unacceptable glitch in the universe.

    It’s time to reboot it with a patch.

  • @[email protected]
    43•29 days ago

    Let us substitute: ( - x, ) - y
    Thus ()() becomes xyxy
    ())( becomes xyyx
    Now clearly it can be seen, even while high, that the second one is and the first isn’t

  • @[email protected]
    26•29 days ago

    for those too lazy to google,
    palindrome /păl′ĭn-drōm″/ noun A word, verse, or sentence, that is the same when read backward or forward. “madam; Hannah; or Lewd did I live, & evil I did dwel.”

    () () backwards is )( )(
    () )( backwards is () )(

  • @[email protected]
    21•29 days ago

    this took me a while but after converting to ascii in hex I get it

    “())(” = 40 41 41 40

    “()()” = 40 41 40 41

    As long your strings aren’t null terminated

    • @[email protected]English
      11•29 days ago

      As long your strings aren’t null terminated

      What kind of monstrous bug prone language would do that?

  • bruhduh
    19•29 days ago

    What about ⊂⁠(⁠(⁠・⁠▽⁠・⁠)⁠)⁠⊃

  • @[email protected]
    13•29 days ago

    Calm down, everyone. Brackets form a tree structure, and can be represented by a free magma, while strings with concatenation are equivalent to a free monoid. You’re essentially asking for the two respective common involutory operations to be connected by this map, just because they’re involutory, which put that way is a wild guess at best. In fact, reversing this string produces something outside the range of the map entirely, which is injective and so can’t be surjective for combinatorical reasons.

    … Yeah I might be the only person that finds that useful.

      • @[email protected]
        2•29 days ago
        I mean,

        the part about the “wild” guess is, but this is a counterexample, and something like the reciprocal vs the negative of reals or rationals when moved across the log map would be an example. So, either you’re a galaxybrain that just instantly knows if the transformation is structure-preserving in that way, or you’re guessing to some degree as well.

        The symbols and abstractions have touched me in no-no ways. I miss okaybuddyphd on r*ddit, they knew the pain.

        I suppose I could also just say that characters which aren’t just drawn asymmetrical, but actually point in a direction as part of their function, look wrong when reversed like this. So, (e) -> )e( is no good, but bed -> deb is fine.

    • @[email protected]
      1•29 days ago

      I’m just going to assume those 4 dollar words are real and you aren’t just misspelling normal words to fuck with us.

      Non surjective free magma? What about the doblastic amortized basalt?

      • @[email protected]
        3•28 days ago

        I was saying unipotent at first instead of involutory, which was actually the wrong jargon because of the context, but I’ve fixed that now. Yes, they’re all real.

        A glossary:

        Involution

        Surjective

        Injective

        Free magma

        Free monoid

        Map, although in this context I could probably have just said function. I go with map by default when thinking bidirectionally.

        I think most people here will know combinatorics, the study of the different possible configurations of something. The number of n-length strings with two possible characters is 2n, as coders should all know, and the number of trees turns out to be Catalan numbers, many of which have prime factors other than 2. This is an injective map from n node trees to 2n character strings, so it’s possible, but you’ll (almost?) never get a perfect match, so by the pigeonhole principle it can’t be surjective.

        I’m wondering now if Catalan numbers are O(n!). The equation has a lot of n! but it also has a certain smell like it might depend on big or little o.

        Edit: D’oh, they must grow no faster than 22n; I just wrote that. So, exponential.