This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - bwang
Pages: 1 ... 22 23 [24] 25 26 ... 44
346
« on: July 01, 2010, 04:21:10 pm »
Doubtful.
Even if they did, 2048-bit keys are not breakable in any reasonable amount of time.
347
« on: July 01, 2010, 01:58:39 am »
The GNFS is not of exponential complexity (in fact, that is why people use it). Its complexity is:
O(exp((c+o(1)) * log(n)^(1/3) * log log (n)^2/3)so doubling n does not double the run time.
348
« on: July 01, 2010, 01:50:10 am »
The Nspire does not yet have an equivalent of TIGCC. However, any standard arm-elf-gcc + GNU development tools will work nicely. Once you get your arm-elf-gcc set up, starting development is as simple as grabbing the skeleton-[windows|linux]-1.0.zip file from the first post here and placing your code in the appropriate places. I think the skeleton files are bug-free now. Nspire development should speed up as more of the standard library is found. Eventually, we should be able to port existing programs without too much trouble.
349
« on: June 30, 2010, 08:13:10 pm »
Considering that the 89 can emulate a Gameboy at acceptable speed, I believe this is possible.
350
« on: June 30, 2010, 04:22:08 pm »
If we use the GNFS, how in the world will we find a computer powerful enough to solve the matrix?
351
« on: June 30, 2010, 03:31:37 am »
Yeah, I'll probably return to this project some time to clean things up, convert everything to fixed-point, and make a real demo.
352
« on: June 30, 2010, 03:12:29 am »
It's not over yet! I have another Nspire project that I'm working on at the moment.
353
« on: June 29, 2010, 04:34:31 am »
Factoring a 1024-bit key in a reasonable amount of time is impossible, even as a collective effort, unless you can find hundreds of thousands of cores.
The 768-bit number factored recently took several months of highly coordinated effort on a cluster.
354
« on: June 23, 2010, 12:18:56 am »
45 - Wolf 3D
And if Nspire programs are allowed:
46 - Ndless
47 - gbc4nspire
355
« on: June 22, 2010, 04:21:30 pm »
Doesn't BASIC's pixel-On follow those conventions too?
356
« on: June 21, 2010, 01:59:55 am »
Hmmm...I have to doublepost  I edited the first post and attached some possibly useful fast (addition only) circle and line routines.
358
« on: June 20, 2010, 07:51:34 pm »
If your pixels travel out of the screen and you don't check the bounds, you will get a crash.
359
« on: June 19, 2010, 04:59:06 pm »
You might be running out of bounds with your setPixel().
360
« on: June 18, 2010, 07:28:10 pm »
@critor: My program varied greatly in speed, depending on what you feed it. For things like simple polynomial expansion, it was quite fast (maybe a couple seconds). For more complex things (rational expansion, algebraic expansion) it was unhappily slow. The algorithmically complicated stuff was slow, despite my attempts to optimize it. For example, factoring an 8th-degree polynomial, integrating a reasonably complex rational expression, and computing a symbolic sum all took around 1-2 minutes. The differentiator was dead slow, but I tacked it on as an afterthought and didn't really take much time to optimize it.
The focus of that project was to implement some nice algorithms in a possibly useful way, so speed was not really of utmost importance during the coding. The most useful parts are the expander, the integrator, the factorizer, and the symbolic sum engine, which can solve problems a human would have trouble solving.
Pages: 1 ... 22 23 [24] 25 26 ... 44
|
Show Posts