Forgot your password?
typodupeerror

Comment Re:The climate is going extreme (Score 1) 114

Not arguing with humans are messing with the climate. But it's not the first time. Just to list a few. The earth has recovered from far worse.

    Great oxidation event. https://en.wikipedia.org/wiki/...

    Ice ages caused by trapped carbon from dying seaweed. https://www.princeton.edu/news...

The Great Oxidation Event (approx. 2.4 billion years ago): Cyanobacteria evolved oxygenic photosynthesis and flooded the young Earth's atmosphere with oxygen. This free oxygen was toxic to the dominant anaerobic micro-organisms of the time, causing a massive planetary die-off of life that could not process it.

Early Land Plant Expansion (Late Paleozoic/Devonian-Carboniferous): The evolution of deep-rooting land plants and vast forests drastically pulled down carbon dioxide levels from the atmosphere and weathered continental rocks. This sudden loss of greenhouse gases triggered severe global cooling and ice ages, starving warm marine shelves and contributing to major recursive extinction pulses.

     

Comment Re:No, It Won't. Wait... (Score 1) 64

Except there are quantum algorithms just waiting for hardware:

The primary quantum algorithms proposed for breaking strong traditional encryption are Shor’s algorithm, which exponentially dismantles asymmetric (public-key) cryptography, and Grover’s algorithm, which quadratically degrades symmetric-key security.

Shor's Algorithm (The Threat to Asymmetric Encryption) Developed by Peter Shor in 1994, this algorithm solves difficult mathematical problems exponentially faster than any classical computer. It uses quantum superposition and the Quantum Fourier Transform to quickly find the prime factors of massive numbers or solve discrete logarithms.

Comment Re:Quick question (Score 1) 67

/*
          * Computation of the n'th decimal digit of \pi with very little memory.
          * Written by Fabrice Bellard on January 8, 1997.
          *
          * We use a slightly modified version of the method described by Simon
          * Plouffe in "On the Computation of the n'th decimal digit of various
          * transcendental numbers" (November 1996). We have modified the algorithm
          * to get a running time of O(n^2) instead of O(n^3log(n)^3).
          *
          * This program uses mostly integer arithmetic. It may be slow on some
          * hardwares where integer multiplications and divisons must be done
          * by software. We have supposed that 'int' has a size of 32 bits. If
          * your compiler supports 'long long' integers of 64 bits, you may use
          * the integer version of 'mul_mod' (see HAS_LONG_LONG).
          */

        #include
        #include
        #include /* uncomment the following line to use 'long long' integers */ /* #define HAS_LONG_LONG */

#ifdef HAS_LONG_LONG
#define mul_mod(a,b,m) (( (long long) (a) * (long long) (b) ) % (m))
#else
#define mul_mod(a,b,m) fmod( (double) a * (double) b, m)
#endif /* return the inverse of x mod y */
int inv_mod(int x, int y)
{
        int q, u, v, a, c, t;

        u = x;
        v = y;
        c = 1;
        a = 0;
        do {
        q = v / u;

        t = c;
        c = a - q * c;
        a = t;

        t = u;
        u = v - q * u;
        v = t;
        } while (u != 0);
        a = a % y;
        if (a > 1;
        if (b == 0)
                break;
        aa = mul_mod(aa, aa, m);
        }
        return r;
} /* return true if n is prime */
int is_prime(int n)
{
        int r, i;
        if ((n % 2) == 0)
        return 0;

        r = (int) (sqrt(n));
        for (i = 3; i = a) {
                do {
                        t = t / a;
                        v--;
                } while ((t % a) == 0);
                kq = 0;
                }
                kq++;
                num = mul_mod(num, t, av);

                t = (2 * k - 1);
                if (kq2 >= a) {
                if (kq2 == a) {
                        do {
                        t = t / a;
                        v++;
                        } while ((t % a) == 0);
                }
                kq2 -= a;
                }
                den = mul_mod(den, t, av);
                kq2 += 2;

                if (v > 0) {
                t = inv_mod(den, av);
                t = mul_mod(t, num, av);
                t = mul_mod(t, k, av);
                for (i = v; i = av)
                        s -= av;
                }

        }

        t = pow_mod(10, n - 1, av);
        s = mul_mod(s, t, av);
        sum = fmod(sum + (double) s / (double) av, 1.0);
        }
        printf("Decimal digits of pi at position %d: %09d\n", n,
              (int) (sum * 1e9));
        return 0;
}

Comment Re: yikes (Score 1) 48

They are saying it does make economic sense.

From the summary: Google believes that launch costs will "fall to less than $200/kg by the mid-2030s." At that point, the "cost of launching and operating a space-based data center could become roughly comparable to the reported energy costs of an equivalent terrestrial data center on a per-kilowatt/year basis."

If that's true then space based AI farms are inevitable.

Slashdot Top Deals

God made the integers; all else is the work of Man. -- Kronecker

Working...