Peter Shor
|
Registered User
|
|
|
May 10 |
comment |
Modern Mathematical Achievements Accessible to Undergraduates Are turbo codes, LDPC codes, or polar codes the best choice for presentation to undergraduates? I think they're all possible, although you probably need a couple of hours to do it well. Turbo codes seem to have the disadvantage that you need more background; in particular, you need to go over convolutional codes first. Does anybody have any comments from experience? |
|
May 6 |
comment |
Modern Mathematical Achievements Accessible to Undergraduates How about Moser's recent constructive proof of the Lovasz Local Lemma? It's the first which actually gives an effective algorithm for finding the object that Lovasz proved existed, and it's accessible for undergrads. |
|
Apr 20 |
comment |
Can every $\mathbb{Z}^2$ disk be pinball-reached? Can you just say: the shortest piecewise linear path from the origin to the desired point where all the segments start and end on discs, and don't path through other discs. It's clear that there are such paths. Now, can we show that there is a shortest one by using compactness? |
|
Apr 19 |
comment |
How to estimate the quantum fidelity between two given states Aren't there exact formulas for all the quantities above? Why do we need any estimation? |
|
Apr 9 |
comment |
Existence of unknowable algorithms ? It's too bad that I don't see how to make an algorithm like this based on the Mordell Conjecture (Falting's Theorem), as that would be quite a bit more natural. |
|
Apr 9 |
accepted | Existence of unknowable algorithms ? |
|
Apr 6 |
revised |
Existence of unknowable algorithms ? I used n for two different things. Fixed now. |
|
Apr 6 |
comment |
Existence of unknowable algorithms ? @Michael: that's right ... the diophantine equation is fixed. Let me fix the variables. |
|
Apr 6 |
answered | Existence of unknowable algorithms ? |
|
Apr 6 |
comment |
Existence of unknowable algorithms ? In fact, I believe there are fairly simple problems with no known algorithms: for example, can this graph be embedded into three-dimensional space so that it does not contain any knotted cycles? (There were certainly no explicit algorithms known for this a few years ago.) |
|
Mar 16 |
comment |
Can a mathematical definition be wrong? Thanks. This is exactly the kind of case I was looking for when I asked the question. |
|
Mar 4 |
awarded | ● Notable Question |
|
Dec 6 |
awarded | ● Nice Answer |
|
Dec 3 |
awarded | ● Yearling |
