S |
"You can raise the argument that intractability is relative. You can boldly thrust forward Moore's Law - like a child that's made a macaroni bird in art class - but if you do, you're not getting it. Intractable is bigger than Moore's Law. Intractable is like, thermodynamics big." - Johnath |
Nice quote, but did he bargain on an infinitely fast CPU? |
17: Fractal exploration and the 3D MandelbrotOkay, maybe I'm biased here, but I had to tag this one in. Fractals can be awesome creatures, but realtime exploration isn't possible due to the calculations needed for deep zooming, decent antialiasing (up to 32x32 per pixel oversampling needed for maximum quality!), and for more complicated fractals including raytracing of 3D fractals. Furthermore, with CPU speed limits a thing of the past, we can hunt for the "Holy Grail" of fractals - the real 3D Mandelbrot. We covered this curious beast in an earlier article, and theorized that it would look like the most awesome fractal ever. If it existed.
Using infinite CPU power is an odd way to solve such an intriguing problem, but frankly I don't care how it gets solved as long as I can glimpse the 3D mandelbrot for even one second. | ||
16: More responsive computersA very simple and obvious use, but one that would prove very welcome. The GUI of the OS would become much more responsive with no apparent lagging or freezing. Yes, even in Windows Vista potentially. Unfortunately, Moore's Law's evil twin - "The Great Moore's Law Compensator" (TGMLC) may strike with an equal but opposite force. It'd be pretty hard to create code so slow and bloated that it nullifies the effect of an infinitely fast CPU, but I wouldn't put it past say, Symantec or Adobe. 15: Cutting stock and packingThere are a wealth of industries that rely on packing something into a space the most efficient way possible. Likewise, cutting material to minimize waste is a tricky problem, at least in the 2 dimensional version. Actually, it's probably the NP-Complete 3D packing problem which would benefit most. As yet, there's no polynomial algorithm found which would help here. And evidence hints there won't ever be one. Infinitely fast CPUs eat these kind of problems for breakfast however. | |
14: Composing musicUnlimited amounts of speed would be a boon for composing, especially when today's VSTs (effectively software synthesizers) can gobble 20% or more of the CPU per channel. Programmers needn't worry about efficiency, and can concentrate on simplicity in their VSTs. Multiple effects such as echo, reverb, phase, or EQ can be set for each track/channel, again without having to worry about annoying hiccups in the playback. Coding kludgy workarounds such as 'freezing' will be a thing of the past, as will latency/timing issues. On the sound processing front, it's still difficult to generate perfectly simulated reverb or time/pitch stretching on the fly. Any other number of effects, particularly those involving FFT, or countless 'granules' and overlaying of sound would become possible, unleashing new musical possibilities. | |
13: Alien huntingSETI could use the speed to analyse galaxies for possible signs of life. Analysing the EM signals our telescopes receive is not an easy task. Amongst the noise, SETI has to look out for particularly dominant signals. That sounds reasonable until you consider that there's mountains of sky, multiple Libraries of Congress worth of frequencies, and that any communication is likely to be pulsed if the alien life is intelligent. There's also the difficulty of doppler shifting, where any possible frequency slides up or down slightly. Currently, SETI is maximizing its chances by spying at the most promising frequencies (inside a few megahertz) and the best parts of space (1 part in 3 million), but to truly cover everything (including finer analysis of the signal), all things considered, it wouldn't hurt to have around 10 quadrillion times (10^16) the processing power, or over 10^22 times faster if we were to do it all one PC (SETI currently has 3 million users). | |