0

I'm not trying to DoSing a wolframalpha web services or their
asserts. but try this expression , click this link and say
to slove ( clusters ) ,

http://www.wolframalpha.com/input?i=find+roots+2^x^785435432564-+48+%3D0

probably it will ever lasting and non terminating the calculation.
Why is that ? anyone curious , how it works ? I think the reason is
zig zag behaviour of the Gradient descent http://en.wikipedia.org/wiki/Gradient_descent

The sampling rate Delta(Err)/Delta(x) is too much higher so it's
recursive forever.

what is you're ideas , please analyze that flaw of wolfram alpha.

3
Contributors
2
Replies
3
Views
7 Years
Discussion Span
Last Post by firstPerson
0

No wonder why the computer can't find the answer. The answer is so big the not even 64-bit can store the number. Instead there is a fatal error. Too many digits for the computer to read the answer or even process the answer...

0

>> what is you're ideas , please analyze that flaw of wolfram alpha
>> The answer is so big the not even 64-bit can store the number
No sh*t. Its approximately 392,717,716,282 digits long. There is no flaw
in wolfram. Its made my brilliant mathematicians and great programmers.
No offence but I am sure you probably won't find any problem with it.

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.