403 reputation
212
bio website
location
age
visits member for 3 years, 6 months
seen Dec 15 at 17:38

Aug
17
comment Are some real numbers “uncomputable”?
Thanks a lot for all your answers, it raises very interesting concepts and notions.
Aug
17
suggested rejected edit on Are some real numbers “uncomputable”?
Aug
17
revised Are some real numbers “uncomputable”?
edited body; edited title
Aug
17
asked Are some real numbers “uncomputable”?
Jul
23
comment Factorial decomposition of integers?
@Olivier, I actually thinking of a mapping between n! and all permutation, and I should have used that as a proof. But since I couldn't find anything on the web about that I had the feeling something was wrong ... :D!
Jul
23
accepted Factorial decomposition of integers?
Jul
23
comment Factorial decomposition of integers?
I was actually thinking about permutation when this question came to my mind, I didn't thought about using it to prove the decomposition. thanks a lot for your answer.
Jul
23
asked Factorial decomposition of integers?
Jul
18
comment indecidability, independency and company
@Theo @Asaf ,thx
Jul
18
accepted indecidability, independency and company
Jul
18
comment indecidability, independency and company
Thanks a lot! that's exactly what I was looking for.
Jul
18
awarded  Student
Jul
18
comment indecidability, independency and company
:D yes.. the y was for the rhyme. I kind of feel pretty frustrated when I cannot go as "far" as I want in the reading of a proof, so I would say that I'm looking for a pretty "complete" book starting from some basics. Something like the introduction book may be. thanks for your advices.
Jul
18
comment indecidability, independency and company
I mean just ZFC
Jul
18
asked indecidability, independency and company
Jul
11
awarded  Scholar
Jul
11
comment Partition Problem, verifying solution in polynomial time
Thanks. That was what I was looking for.
Jul
11
accepted Partition Problem, verifying solution in polynomial time
Jul
11
comment Partition Problem, verifying solution in polynomial time
@deinst : thanks first, and I was wondering, for the travelling salesman problem (NP-complete too) how do you tell if the equation is satisfiable ? since it's a min ?
Jul
11
comment Partition Problem, verifying solution in polynomial time
thanks, but That's not really my question. I know that for a perfect partition it's easy to test (it's either 1 or 0, just make the calculation) But when I have a solution that is not perfect, how do I know in polynomial time my solution is not THE solution ? I've edited the post