• driving_crooner@lemmy.eco.br
      link
      fedilink
      arrow-up
      86
      ·
      10 个月前

      That’s not how it’s works. Being “infinite” is not enough, the number 1.110100100010000… is “infinite”, without repeating patterns and dosen’t have other digits that 1 or 0.

      • Cruxus
        link
        fedilink
        arrow-up
        43
        ·
        edit-2
        10 个月前

        to be fair, though, 1 and 0 are just binary representations of values, same as decimal and hexadecimal. within your example, we’d absolutely find the entire works of shakespeare encoded in ascii, unicode, and lcd pixel format with each letter arranged in 3x5 grids.

          • leverage@lemdro.id
            link
            fedilink
            English
            arrow-up
            8
            ·
            10 个月前

            You can encode base 2 as base 10, I don’t think anyone is saying it exists in binary form.

            • Turun@feddit.de
              link
              fedilink
              arrow-up
              14
              ·
              10 个月前

              No, because you can’t mathematically guarantee that pi contains long strings of predetermined patterns.

              The 1.101001000100001… example by the other user was just that - an example. Their number is infinite, but never contains a 2. Pi is also infinite, but does it contain the number e to 100 digits of precision? Maybe. Maybe not. The point is, we don’t know and we can’t prove it either way (except finding it by accident).

        • CanadaPlus@lemmy.sdf.org
          link
          fedilink
          arrow-up
          7
          ·
          edit-2
          10 个月前

          Actually, there’d only be single pixels past digit 225 in the last example, if I understand you correctly.

          If we can choose encoding, we can “cheat” by effectively embedding whatever we want to find in the encoding. The existence of every substring in a one of a set of ordinary encodings might not even be a weaker property than a fixed encoding, though, because infinities can be like that.

      • Fubber Nuckin'@lemmy.world
        link
        fedilink
        arrow-up
        9
        ·
        10 个月前

        If it’s infinite without repeating patterns then it just contain all patterns, no? Eh i guess that’s not how that works, is it? Half of all patterns is still infinity.

          • Ultraviolet@lemmy.world
            link
            fedilink
            English
            arrow-up
            9
            ·
            10 个月前

            However, as the name implies, this is nothing special about pi. Almost all numbers have this property. If anything, it’s the integers that we should be finding weird, like you mean to tell me that every single digit after the decimal point is a zero? No matter how far you go, just zeroes forever?

          • kn0wmad1c@programming.dev
            link
            fedilink
            English
            arrow-up
            4
            ·
            10 个月前

            Yeah, but your number doesn’t fit pi. It may not have a pattern, but it’s predictable and deterministic.

            • OhNoMoreLemmy@lemmy.ml
              link
              fedilink
              arrow-up
              8
              ·
              10 个月前

              Pi is predictable and deterministic.

              Computer programs exist that can tell you what the next digit is. That means it’s deterministic, and running the program will give you a prediction for each digit (within the memory constraints of your computer).

              The fact that it’s deterministic is exactly why pi is interesting. If it was random it would typically be much easier to prove properties about it’s digits.

              • kn0wmad1c@programming.dev
                link
                fedilink
                English
                arrow-up
                2
                ·
                edit-2
                10 个月前

                There’s no way to predict what the next unsolved pi digit will be just by looking at what came before it. It’s neither predictable nor deterministic. The very existence of calculations to get the next digit supports that.

                Note: I’m not saying Pi is random. Again, the calculations support the general non-randomness of it. It is possible to be unpredictable, undeterministic, and completely logical.

                Note Note: I don’t know everything. For all I know, we’re in a simulation and we’ll eventually hit the floating point limit of pi and underflow the universe. I just wanted to point out that your example doesn’t quite fit with pi.

                • Tlaloc_Temporal@lemmy.ca
                  link
                  fedilink
                  arrow-up
                  5
                  ·
                  10 个月前

                  π isn’t deterministic? How do you figure that? If two people calculate π they get different answers?

                  What π is, is fully determined by it’s definition and the geometry of a circle.

                  Also, unpredictable? Difficult to predict, sure. Unpredictable by simple methods, sure. But fully impossible to predict at all?

        • driving_crooner@lemmy.eco.br
          link
          fedilink
          arrow-up
          8
          ·
          10 个月前

          Not, the example I gave have infinite decimals who doesn’t repeat and don’t contain any patterns.

          What people think about when said that pi contain all patters, is in normal numbers. Pi is believed to be normal, but haven’t been proven yet.

          An easy example of a number who contains “all patterns” is 0.12345678910111213…

      • pivot_root@lemmy.world
        link
        fedilink
        arrow-up
        5
        ·
        10 个月前

        In some encoding scheme, those digits can represent something other than binary digits. If we consider your string of digits to truly be infinite, some substring somewhere will be meaningful.

        • Boomer Humor Doomergod@lemmy.world
          link
          fedilink
          English
          arrow-up
          2
          ·
          10 个月前

          One of the many things I loved about Sagan’s Contact is that, at the end, they found a pattern in pi when put into base 13. He didn’t really go into it as it was the end of the book, but I really wish he’d survived to write a sequel.

  • ILikeBoobies@lemmy.ca
    link
    fedilink
    arrow-up
    25
    ·
    10 个月前

    “I may be a staunch atheist,” said Richard Stallman, creator of the GNU + Linux operating system and self-proclaimed architect of the modern world, “but any decent analysis in comparative religion would conclude that the universe is a copyleft creation, thereby pi should automatically fall under the terms of the GNUv3 license.”

    Lol, he would actually say that

  • livingcoder@programming.dev
    link
    fedilink
    arrow-up
    17
    ·
    edit-2
    10 个月前

    Is there an algorithm or number such that we could basically pirate data from it by saying “start digit 9,031,643,679 with length 5,345,109 is an MP4 of Shrek”? Something that we could calculate in a day or less?

    • AVincentInSpace@pawb.social
      link
      fedilink
      English
      arrow-up
      23
      ·
      10 个月前

      The short answer is no, and even if we could, the digit index you’d start at would have a larger binary representation than the actual data you were trying to encode.

    • apex32@lemmy.world
      link
      fedilink
      arrow-up
      18
      ·
      10 个月前

      An example I found: the string of digits 0123456789 occurs at position 17387594880. In this case, it took 11 digits to describe where to find a 10-digit number.

      So I think such an algorithm would technically work, but your “start digit” would be so large it would use more data than just sending the raw file data. Not to mention the impossible amount of computing power needed.

      • livingcoder@programming.dev
        link
        fedilink
        arrow-up
        1
        ·
        10 个月前

        What if instead we utilized an algorithm, some code, that would ultimately generate the file? I could imagine a program that generates a number which ultimately is more dense than the program. For example, if we just-so-happened to need a million digits of Pi the program would be shorter than the number. Is there a way to tailor an algorithm to collapse down to any number? As an example, what if we needed a million digits of Pi but the last 10 digits need to be all 9s?

    • nova_ad_vitum@lemmy.ca
      link
      fedilink
      arrow-up
      10
      ·
      10 个月前

      Similarly: if you write a program to randomly run through all the combinations of pixels on a decently large screen (say, 1080p) you will eventually see every important question and answer that can be expressed on a screen.

    • WolfLink@sh.itjust.works
      link
      fedilink
      arrow-up
      5
      ·
      10 个月前

      Conceptually this is basically just standard encryption: some math that spits out gibberish unless you have the info to make that gibberish become something useful.

    • mlg@lemmy.world
      link
      fedilink
      English
      arrow-up
      3
      ·
      10 个月前

      I think if you can ridiculously compress the size down then maybe lol.

      • livingcoder@programming.dev
        link
        fedilink
        arrow-up
        4
        ·
        10 个月前

        Do you happen to know of any good algorithms or numbers? Pi gets harder to calculate with each digit, so it’s not a great candidate.

    • Tlaloc_Temporal@lemmy.ca
      link
      fedilink
      arrow-up
      2
      ·
      10 个月前

      Welp, time for quectoquectoquectoquectoquectometers.

      Actually, a plank length seems to be 10 microquectometers, so my first guess might only be necessary for interpretation of the world, and not physical accuracy.