383 reputation
19
bio website
location
age
visits member for 3 years, 3 months
seen Apr 27 '12 at 17:09

Jul
2
awarded  Curious
Jan
23
awarded  Popular Question
Oct
24
awarded  Popular Question
May
10
awarded  Popular Question
Apr
30
awarded  Yearling
Apr
11
awarded  Supporter
Apr
11
awarded  Student
Apr
11
awarded  Scholar
Apr
11
awarded  Editor
Apr
11
awarded  Commentator
Mar
30
comment Do there exist algorithms for which super computers are difficult to exceed personal computers in speed?
Again very sorry for my English. I wanted to say , "or personal computers do 100 times slower than supercomputers ,but not 10000 times slower".
Mar
30
accepted Do there exist algorithms for which super computers are difficult to exceed personal computers in speed?
Mar
30
comment Do there exist algorithms for which super computers are difficult to exceed personal computers in speed?
I am sorry for the English words. Yes, or personal computers do in 100th of the time of supercomputers ,but not 10000th.
Mar
30
revised Do there exist algorithms for which super computers are difficult to exceed personal computers in speed?
edited title
Mar
30
asked Do there exist algorithms for which super computers are difficult to exceed personal computers in speed?
Mar
12
accepted For an enough large integer N, can it be a random seed for small positive integers?
Mar
11
comment For an enough large integer N, can it be a random seed for small positive integers?
@Marc I mean $(N modulo s).
Mar
11
revised For an enough large integer N, can it be a random seed for small positive integers?
added 2 characters in body
Mar
11
asked For an enough large integer N, can it be a random seed for small positive integers?
Mar
7
accepted Is my algorithm probabilistically fair?