Hacker News
- Is C99 actually Turing-complete? (2016) https://cs.stackexchange.com/questions/60965/is-c-actually-turing-complete 75 comments
- Can you create mind in a computer? https://cs.stackexchange.com/questions/149289/can-you-create-mind-in-a-computer 2 comments
- Why is quicksort better than other sorting algorithms in practice? (2013) https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice 63 comments
- Computer Science Stack Exchange site is now up in public beta http://cs.stackexchange.com/ 20 comments
- Minimum cost path connecting exactly K vertices https://cs.stackexchange.com/questions/168278/minimum-cost-path-connecting-exactly-k-vertices 5 comments algorithms
- Are there NP COMPLETE problems that are "easy" in practice? https://cs.stackexchange.com/questions/103776/are-there-np-complete-problems-that-are-easy-in-practice 29 comments compsci
- Reference request: Compiler optimization pass joining identical function definitions together (or specializing them) https://cs.stackexchange.com/q/159936/48157 11 comments compilers
- Which maintainability metric has the strongest empirical evidence? https://cs.stackexchange.com/questions/145436/which-maintainability-metric-has-the-strongest-empirical-evidence/145452 73 comments programming
- What evidence do we have for or against a correlation between fault density and LOC? https://cs.stackexchange.com/questions/144527/what-evidence-do-we-have-for-or-against-a-correlation-between-fault-density-and/144630 22 comments programming
- What's the formal reason one can interpret functors as generalized containers? https://cs.stackexchange.com/questions/119777/functor-laws-and-natural-transformations-in-haskell 27 comments haskell
- Why is quicksort better than other sorting algorithms in practice? (2013) https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice 53 comments programming
- How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect https://cs.stackexchange.com/questions/29475/how-to-fool-the-try-some-test-cases-heuristic-algorithms-that-appear-correct 3 comments programming
- Has this combinatorics problem regarding the syntax of SAT expressions been explored before? https://cs.stackexchange.com/questions/103341/could-you-show-the-intractibility-of-sat-by-showing-that-the-number-of-variables 26 comments math
- Algorithm for using power series to numerically solve a partial differential equation given a boundary condition? https://cs.stackexchange.com/questions/95886/algorithm-for-using-power-series-to-numerically-solve-a-partial-differential-equ 11 comments math
- Why are Buchi automata factorially succinct when compared to Rabin Automata? https://cs.stackexchange.com/questions/91159/why-are-buchi-automata-factorially-succinct-when-compared-to-rabin-automata 5 comments compsci
- Why is the set of all eventually periodic words not Buchi Recognizable? https://cs.stackexchange.com/questions/88440/the-set-of-all-eventually-periodic-words-is-not-buchi-recognizable 2 comments compsci
- How to find the interior volume for a given set of 3D points? https://cs.stackexchange.com/questions/87838/how-to-find-the-interior-volume-for-a-given-set-of-3d-points 6 comments compsci
- Why is writing down mathematical proofs more fault-proof than writing computer code? https://cs.stackexchange.com/questions/85327/why-is-writing-down-mathematical-proofs-more-fault-proof-than-writing-computer-c 9 comments math
- Why is static-single assignment preferred over continuation passing style in many industry-used compilers? https://cs.stackexchange.com/questions/74794/why-is-static-single-assignment-preferred-over-continuation-passing-style-in-man 12 comments compsci
- Why are some programming languages "faster" or "slower" than others? http://cs.stackexchange.com/q/71979/42500 87 comments compsci
- Why, really, is the Halting Problem so important? http://cs.stackexchange.com/questions/32845/why-really-is-the-halting-problem-so-important/32853#32853 11 comments programming
- A generalization of the vertex cover problem http://cs.stackexchange.com/q/68466/2280 7 comments compsci
- Can I think of NP using a parallelism model? http://cs.stackexchange.com/questions/64679/np-with-a-parallelism-model 11 comments compsci
- Is every problem a decision problem? http://cs.stackexchange.com/a/13670/22046 6 comments compsci
- How to implement a prolog interpreter in a purely functional language? http://cs.stackexchange.com/questions/6618/how-to-implement-a-prolog-interpreter-in-a-purely-functional-language 17 comments programming
- Efficient algorithm for this optimization problem? Dynamic programming? http://cs.stackexchange.com/questions/41519/efficient-algorithm-for-this-optimization-problem-dynamic-programming 20 comments compsci
- Are personal computers finite state machines? http://cs.stackexchange.com/questions/16729/are-real-computers-finite-state-machines 37 comments askscience
- Fastest known complexity for combinatorial ILP algorithm? http://cs.stackexchange.com/questions/37550/fastest-known-complexity-for-combinatorial-ilp-algorithm 4 comments compsci
- Minimum number of givens for General Sudoku of size n^2 x n^2 https://cs.stackexchange.com/questions/40394/minimum-number-of-givens-for-general-sudoku-of-size-n2-times-n2 4 comments math
- Computer science for programmers http://cs.stackexchange.com/questions/28051/computer-science-for-programmers 31 comments compsci
- What is the novelty in MapReduce? How is it different from just standard divide & conquer in, say, merge sort? Good discussion on the Computer Science StackExchange. http://cs.stackexchange.com/q/3019/55 46 comments programming
- Some questions about computational models http://cs.stackexchange.com/questions/3154/how-to-show-two-models-of-computation-are-equivalent 15 comments compsci
- Category theory is type theory http://cs.stackexchange.com/questions/3028/is-category-theory-useful-for-learning-functional-programming#3256 22 comments compsci
- data structures - Interesting methods of maintaining an efficient ordering where elements can dynamically be inserted "in between" any two other elements in the ordering. http://cs.stackexchange.com/q/14708/2755 6 comments compsci
- Example of an LR(•) language that is not LL(•)? http://cs.stackexchange.com/questions/43/language-theoretic-comparison-of-ll-and-lr-grammars/48#48 11 comments compsci
- Computer Science stackexchange, currently in beta a great resource but could use some more activity. Check it out! http://cs.stackexchange.com/ 8 comments compsci
- Why is quicksort better than other sorting algorithms in practice? http://cs.stackexchange.com/q/3/98 38 comments compsci
- Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines? http://cs.stackexchange.com/q/419/773 3 comments compsci
- How can it be decidable whether π has some sequence of digits? http://cs.stackexchange.com/q/367/773 42 comments compsci
- How not to solve P = NP? http://cs.stackexchange.com/q/1877/1238 8 comments compsci