3 ms·

i = 0 while True: i += 1 Also never repeats..

• Xeoncross 3y ago
  except for the forever part ints(8-128) will either wrap around (repeating) or will overflow error in any language I've ever used
  • miloignis 3y ago
    Python uses BigInts, so it will go until it runs out of RAM, I believe.
    • Xeoncross 3y ago
      Imagine a computer lasting long enough to count to a number larger than what fits in 8GB of RAM...
      • istjohn 3y ago
        Let's see... The age of the universe in Planck time requires 200 bits to represent as an integer. The number of Planck cubes in the universe can be represented with 611 bits. 1 KB can represent an integer as large as 2^8000 = 10^2408. 10^2408 Planck times is 10^2347 x (age of universe). The last of the stars will burn out in 10^73 Planck times from now.
  • missblit 3y ago
    Hey this is a math fight, no computer architecture allowed!
    • callamdelaney 3y ago
      Yes, if I knew the mathematical notation for the same thing I’d have used that. Overflow is not the point..
• zx321 3y ago
  https://en.wikipedia.org/wiki/Champernowne_constant https://en.wikipedia.org/wiki/Champernowne_constant