Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on The most common errors in undergraduate mathematics. Parent comment
- Confusing asymptotic upper bounds with worst-cases,
- Assuming asymptotic bounds can only refer to running times,
- Not being clear about what "n" represents in O(f(n)),
- Not specifying a model of computation before talking about complexity,
- Confusing (complexity-class) hardness with completeness,
- Confusing Turing recognisability with decidability,
- Confusing decision problems with function problems,
- Assuming proofs of decidability must be constructive,
- Assuming O(2^n) == O(3^n),
- Not recognising O(lg(n)) == O(ln(n)).
For programming, I think simple type mistakes are a biggie...
There are no comments on this comment yet.
- Confusing asymptotic upper bounds with worst-cases,
- Assuming asymptotic bounds can only refer to running times,
- Not being clear about what "n" represents in O(f(n)),
- Not specifying a model of computation before talking about complexity,
- Confusing (complexity-class) hardness with completeness,
- Confusing Turing recognisability with decidability,
- Confusing decision problems with function problems,
- Assuming proofs of decidability must be constructive,
- Assuming O(2^n) == O(3^n),
- Not recognising O(lg(n)) == O(ln(n)).
For programming, I think simple type mistakes are a biggie...