TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Manuel Blum: Advice to a beginning graduate student

55 点作者 r11t超过 14 年前

5 条评论

jdp23超过 14 年前
A classic from 2001.<p>I was a grad student at Berkeley in the 80s in Theoretical Computer Science before heading off in a different direction, and got as far as taking my oral prelims from Manuel Blum and Richard Karp. No pressure! Rather embarassingly I forgot the Blum speedup theorem until I was prompted for it. They were both very nice about it though.
wittgenstein超过 14 年前
"For example, Finite Automata can add but not multiply."<p>Can someone please explain why this is true? If it can add, how can it not multiply if multiplication is repeated addition?
评论 #2038782 未加载
评论 #2038786 未加载
forensic超过 14 年前
most of it only applies to a few classical hard sciences - math, physics, chemistry, engineering<p>a lot of it doesnt even apply to CS in my opinion
评论 #2037770 未加载
HilbertSpace超过 14 年前
I see Blum's advice as very misleading and a disservice to all concerned.<p>Here is my view (worked for me):<p>Note that the main goal is the Ph.D. A second goal is, if you wish, a start on capabilities in research.<p>Okay, for both, especially the first, there is a condition that is essentially both necessary and sufficient: PUBLISH.<p>Right: F'get about the 'dissertation' for now. Instead, just PUBLISH.<p>Why? At many of the best research universities, the official criterion for a Ph.D. dissertation is "an original contribution to knowledge worthy of publication". So, publish (did I mention that before?) and remove all doubt.<p>Note: Typically just publishing is easier than slogging through all the nonsense of dissertation proposal, research on a problem from a dissertation advisor, getting the dissertation approved by a committee, etc.<p>Now, what to publish?<p>Pick a problem and solve it. The usual criteria for publication are "new, correct, and significant".<p>Pick your own problem. Try hard to avoid a problem given by a prof.<p>How to solve it? First remember that in essentially all fields, the most admired research presents a mathematical solution. So, get one.<p>How to do that? Study appropriate mathematics. For the 'computing', mostly f'get about CS because for computing problems, compared with the math, it's next to junk.<p>How to pick a problem? To help meet the 'significant' part, pick a problem with some obvious practical importance. Typically find this problem off campus. E.g., maybe do something in server farm monitoring, performance, cost, response to load uncertainty, etc.<p>Broad solution direction: Find 'optimal' means for attacking the ubiquitous uncertainty.<p>How to say that your solution is significant? Get a solution that is provably 'optimal' in some sense. In particular, don't try to plow ground in some theoretical direction starting where all the profs broke their plows. Especially, f'get about P versus NP.<p>To get a math solution, start by studying, guess what, right, math.<p>Summary: Pick a practical problem that is clearly of importance. Use math to get 'new, correct, significant' solution. Publish the solution.<p>If one such paper is enough, fine. Else publish about three papers, likely on the same problem, that is, as one 'research stream', stack up the papers, put on a title page, put a staple in the UL corner, and submit it. Your profs have to admit that your work has been judged 'new, correct, and significant' and definitely is 'worthy of publication'.<p>For a better start on research, do the same thing but just do it a little deeper, especially in the math.<p>What math? Linear algebra -- through Halmos. Modern algebra -- pick something, maybe old Birkhoff and Mclane, Herstein, or Lang or something newer. Advanced calculus -- through Rudin. Measure theory and functional analysis -- the real half of Rudin's R&#38;CA and Royden. Optimization -- linear programming, linear programming on networks (often get integer programming for free -- looks NP-complete but it's not), nonlinear programming (especially the Kuhn-Tucker conditions). Probability based on measure theory -- Breiman, Chung, Neveu, Loeve, Chow and Teicher. The above is a bit minimal; more could be from important up to really valuable.<p>Generally you are trying to find tools in math not yet well exploited for problems in computing. So, if find something relatively new in math, then almost certainly it has not yet been well exploited.<p>Under no circumstances take seriously anything in math done by any CS prof; in particular, totally flush 'machine learning, artificial intelligence, and data mining' -- good problems but total puke for work. Stay with math from names such as I listed: You'll be flying in luxury at Mach 3 at 40,000 feet while the CS profs are still slogging in mud and covered in puke.<p>Study some mathematical statistics -- hold your nose at how badly they do the math.<p>Good way to get tight bounds: Use the martingale inequality, fairly easy to apply and one of the strongest in math. See examples of Talagrand and Rhee. Yes, they got a lot of nice papers getting some tight bounds on, right, even NP-complete problems.<p>Generally the key is the math, and in the math, especially if go to seminars by the best people, can find 'themes' and 'directions' that can result in research 'paradigms' and lots of papers.<p>Then get on with making money!
JonnieCache超过 14 年前
He may have won the turing prize but he's apparently forgotten what linebreaks are for in written english.
评论 #2038644 未加载