• Lvxferre@lemmy.ml
    link
    fedilink
    arrow-up
    11
    ·
    edit-2
    1 year ago

    Biological evolution and languages changing over time. They’re so similar that we can create a lot of parallels between both that are useful for both disciplines:

    • “species” as defined by the shared genetic pool vs. “language” as defined by mutual intelligibility
    • ring species vs. dialect continuum
    • horizontal gene transmission vs. borrowing of vocabulary, grammatical features, and phonological features
    • cladograms are pretty much the same, including their pros and cons
    • latest common ancestor being a hypothetical construct vs. “proto-” reconstructions (e.g. Proto-Romance vs. Latin)

    Because the underlying reasoning is exactly the same. You have an abstract system that piles up small changes over time, and those changes may be shared across different populations within that pool.

    You need to watch out for a few differences too. For most part, biological evolution is driven by the interaction between phenotype and the environment, while linguistic evolution is more often than not some mutation with no intrinsic selective value, piggybacking on something outside language (e.g. speaker prestige).

  • OceanSoap@lemmy.ml
    link
    fedilink
    arrow-up
    13
    arrow-down
    4
    ·
    1 year ago

    Democrats and Republicans.

    I’ll take my downvotes like the lady I am.

    Still true, though.

  • Dandroid@dandroid.app
    link
    fedilink
    arrow-up
    9
    ·
    1 year ago

    Aren’t Sudoku and protein folding essentially the same problem? Like, if you could write a computer program to solve sudoku in polynomial time, you could adapt that solution to solve protein folding problems in polynomial time? Or something like that.

    Someone who is smarter than me, please chime in.

    • phorq@lemmy.ml
      link
      fedilink
      arrow-up
      6
      ·
      1 year ago

      You’re talking about the theory of p = np. The idea that any problem whose solution can be verified quickly can also be solved quickly. This has not been proven or disproven, it’s a bit of an open mystery in computer science, but most are under the impression this is not the case and that p != np. Someone smarter than me please verify my explanation in linear time please.

      • Riven@sh.itjust.works
        link
        fedilink
        arrow-up
        3
        ·
        1 year ago

        Specifically I think they’re talking about the subclass of np problems called “np complete” that are functionally identical to each other in some mathy way such that solving one of them instantly gives you a method to solve all of them.

  • RotaryKeyboard@lemmy.ninja
    link
    fedilink
    English
    arrow-up
    7
    ·
    1 year ago

    It took me a while to figure out that an over-the-counter sleep aid and the Benadryl I would buy for allergy symptoms were, in fact, exactly the same drug, Diphenhydramine, packaged under different names.

    • Bongles@lemm.ee
      link
      fedilink
      English
      arrow-up
      1
      ·
      1 year ago

      Other medicines too, acetaminophen is in some headache stuff I have so when I got a cold I just popped that when I was out of cold medicine