Kaveh
|
Registered User
|
PhD student in University of Toronto, Department of Computer Science, Theory Group.
|
|
Apr 12 |
accepted | Non-constructive proofs vs. efficient algorithms |
|
Apr 10 |
comment |
Approximate number of primes below a given integer? @Joël, unregistered users cannot edit their own posts: there is no way to log into an unregistered account. The software uses a temporary cookie in the browser to remember unregistered users, however as soon as the cookie is deleted the user looses access to the account. |
|
Apr 10 |
comment |
Approximate number of primes below a given integer? @Barry, it seems that Alex does not have a registered account so he can't comment or edit. |
|
Apr 10 |
revised |
Approximate number of primes below a given integer? moving the non-answer into the question |
|
Apr 6 |
comment |
Existence of unknowable algorithms ? See cstheory.stackexchange.com/questions/12162/… |
|
Apr 5 |
awarded | ● Necromancer |
|
Apr 5 |
revised |
Non-constructive proofs vs. efficient algorithms added 84 characters in body |
|
Apr 5 |
revised |
Non-constructive proofs vs. efficient algorithms added 111 characters in body; added 1 characters in body |
|
Apr 5 |
revised |
Non-constructive proofs vs. efficient algorithms fixing typos |
|
Apr 5 |
answered | Non-constructive proofs vs. efficient algorithms |
|
Apr 5 |
revised |
Non-constructive proofs vs. efficient algorithms edited tags |
|
Apr 5 |
comment |
Why is every finite set Diophantine? Polynomial equations are special case of Diophantine equations, i.e. there is not need for the quantified x. |
|
Feb 8 |
answered | Computable nonstandard models for weak systems of arithemtic |
|
Feb 8 |
comment |
Computable nonstandard models for weak systems of arithemtic related: mathoverflow.net/questions/34240/… |
|
Feb 1 |
comment |
Properties of the subgradient method Copy on cstheory: cstheory.stackexchange.com/q/16315 |
|
Jan 25 |
revised |
Nelson’s program to show inconsistency of ZF deleted 2 characters in body; edited tags |
|
Jan 25 |
revised |
Natural numbers of great kolmogorov complexity edited tags |
|
Jan 25 |
revised |
Is it possible to construct a finite mathematical universe? added 4 characters in body; edited tags; edited tags |
|
Jan 25 |
revised |
Does there exist a non-trivial Ultrafinitist set theory? edited tags |
|
Jan 22 |
comment |
Does Godel’s incompleteness theorem admit a converse? You may want to check sequential theories defined by Pavel Pudlak. Also have a look at these slides by Albert Visser: bbk.ac.uk/philosophy/our-research/ppp/… There are interpretability versions of Godel's theorem that might be helpful in what you are looking for. |
|
Jan 13 |
awarded | ● Nice Answer |
|
Dec 5 |
awarded | ● Nice Answer |
