|
Jun
14 |
|
answered | Terminology for games with incomplete information and no prior beliefs |
|
Jun
10 |
|
answered | A public key cryptographic technique usable without aid of computer |
|
May
26 |
|
answered | External Regret and Nash Equilibrium |
|
May
22 |
|
answered | Does membership of academic honour societies carry any professional weight / recognition? |
|
May
9 |
|
answered | Why economists should care about computational complexity |
|
Apr
30 |
|
comment |
Professor withholding course grade until submission of conference paper Can you submit to a journal instead of a conference? In that case, I suggest this one: universalrejection.org |
|
Apr
18 |
|
awarded | Good Answer |
|
Mar
21 |
|
awarded | Yearling |
|
Mar
21 |
|
awarded | Yearling |
|
Feb
27 |
|
comment |
How do "lecturers" differ from "professors" in large universities? Note: Some universities have a career lecturer/teaching professor track. At such universities, you can be promoted to "senior lecturer", and although this doesn't come with tenure, it switches over to something more like a 5 year contract instead of a 1 year contract, and the intent is to allow people to stay at the university long term. |
|
Feb
25 |
|
answered | How young is typically “young”? |
|
Feb
24 |
|
awarded | Nice Answer |
|
Dec
8 |
|
awarded | Nice Answer |
|
Dec
5 |
|
awarded | Student |
|
Dec
5 |
|
asked | Multiplicative version of Mcdiarmid's inequality? |
|
Nov
20 |
|
comment |
Can Turing Machine implements Strong AI? If "Strong AI" means coding a Turing Machine to simulate -you-, then certainly if this is possible, you cannot solve the halting problem (since you are a Turing Machine). I think at least among computer scientists, this would be the majority view of the world: that (a), strong AI is possible, and that therefore (b), humans are no better than Turing machines at solving undecidable problems. |
|
Nov
5 |
|
accepted | Maximizing sum edge weights |
|
Nov
3 |
|
comment |
How important is age in CS phd admissions? Why will your masters degree take 4 years? |
|
Nov
1 |
|
comment |
Was the reason that Computers were invented to solve a philosophical question about the foundations of mathematics? George Dyson's book, "Turings Cathedral" (which despite the title is a history of Von Neumann and his development of the computer) suggests that Von Neumann was fond of Turing, and very aware of his work, and that the similarity is no accident. |
|
Nov
1 |
|
answered | Was the reason that Computers were invented to solve a philosophical question about the foundations of mathematics? |
