186 reputation
5
bio website
location Jerusalem, Israel
age 30
visits member for 2 years, 11 months
seen Feb 15 at 14:00

Computer geek; done a lot, learned a lot, willing to share.

In addition to answering questions on StackOverflow, I use this site as a knowledge base for documenting problems I've encountered and solved.


Oct
31
comment Projection linear transformation: explain the wording
Please explain. What do you mean by "projected to 1"? The operator is $T:R^2\to R^2$ so it should project into $R^2$, shouldn't it?
Oct
31
revised Projection linear transformation: explain the wording
Fix typo
Oct
30
asked Projection linear transformation: explain the wording
Feb
10
accepted Nondeterministic Turing machines, tape “forking” and shared memory
Feb
6
asked Nondeterministic Turing machines, tape “forking” and shared memory
Feb
4
accepted Does RP complexity class (usually) mean decidable or recognizable?
Feb
4
revised Does RP complexity class (usually) mean decidable or recognizable?
Formatting
Feb
4
accepted Why isn't the naive PRIMES algorithm in P?
Feb
3
awarded  Tumbleweed
Feb
3
asked Why isn't the naive PRIMES algorithm in P?
Feb
3
asked Does RP complexity class (usually) mean decidable or recognizable?
Jan
28
revised Does little-o notation imply going into infinity?
added 17 characters in body
Jan
28
accepted Does little-o notation imply going into infinity?
Jan
28
comment Does little-o notation imply going into infinity?
Thanks! This helps.
Jan
28
comment Does little-o notation imply going into infinity?
What I meant is that not only f(n) >= g(n) for some n, but f(n)=M so that g(n)<=M and g(x)<=M for all x.
Jan
28
comment Does little-o notation imply going into infinity?
I've updated the question. I hope I'm not too confused.
Jan
28
revised Does little-o notation imply going into infinity?
added 141 characters in body
Jan
28
awarded  Editor
Jan
28
comment Does little-o notation imply going into infinity?
Whoops, I mixed up f and g :)
Jan
28
revised Does little-o notation imply going into infinity?
whoops