Kaveh
  • Member for 9 years, 10 months
  • Last seen this week
31 answers
213 votes
51k views
125 bookmarks
Why is writing down mathematical proofs more fault-proof than writing computer code?
12 answers
145 votes
42k views
86 bookmarks
Why are there so many programming languages?
15 answers
121 votes
15k views
56 bookmarks
How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect
5 answers
104 votes
17k views
54 bookmarks
How not to solve P=NP?
5 answers
99 votes
9k views
33 bookmarks
What are the reasons to learn different algorithms / data structures serving the same purpose?
11 answers
93 votes
24k views
94 bookmarks
Solving or approximating recurrence relations for sequences of numbers
6 answers
85 votes
15k views
30 bookmarks
Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?
6 answers
81 votes
20k views
44 bookmarks
How can we assume that basic operations on numbers take constant time?
2 answers
77 votes
10k views
51 bookmarks
What is coinduction?
9 answers
75 votes
10k views
28 bookmarks
What properties of a programming language make compilation impossible?
4 answers
72 votes
31k views
21 bookmarks
(When) is hash table lookup O(1)?
4 answers
52 votes
7k views
13 bookmarks
Why polynomial time is called "efficient"?
6 answers
46 votes
6k views
31 bookmarks
Dealing with intractability: NP-complete problems
1 answers
41 votes
2k views
11 bookmarks
Imagine a red-black tree. Is there always a sequence of insertions and deletions that creates it?
3 answers
40 votes
4k views
20 bookmarks
Decision problems vs "real" problems that aren't yes-or-no
7 answers
40 votes
4k views
15 bookmarks
Explaining the relevance of asymptotic complexity of algorithms to practice of designing algorithms
2 answers
37 votes
14k views
35 bookmarks
How do I construct reductions between problems to prove a problem is NP-complete?
14 answers
36 votes
5k views
13 bookmarks
Criteria for selecting language for first programming course
3 answers
33 votes
3k views
16 bookmarks
Why is Relativization a barrier?
2 answers
31 votes
3k views
23 bookmarks
How are programming languages and foundations of mathematics related?
3 answers
29 votes
909 views
11 bookmarks
Measuring the difficulty of SAT instances
9 answers
28 votes
4k views
13 bookmarks
Are programming languages becoming more like natural languages?
7 answers
27 votes
15k views
35 bookmarks
Start learning about Theory of Distributed Systems?
2 answers
26 votes
5k views
13 bookmarks
Data structure with search, insert and delete in amortised time $O(1)$?
3 answers
26 votes
3k views
9 bookmarks
What is the relation between functors in SML and Category theory?
2 answers
22 votes
1k views
12 bookmarks
What is meant by Category theory doesn't yet know how to deal with higher-order functions?
2 answers
22 votes
3k views
3 bookmarks
Reduce the following problem to SAT
0 answers
22 votes
508 views
5 bookmarks
Approximate minimum-weighted tree decomposition on complete graphs
3 answers
21 votes
2k views
6 bookmarks
Do functions with slower growth than inverse Ackermann appear in runtime bounds?
3 answers
20 votes
639 views
7 bookmarks
Problems in P with provably faster randomized algorithms