Hacker News
- If Real computers have finite number of states, why Turing machines are needed? http://cstheory.stackexchange.com/q/34398/1037 4 comments
- What is the contribution of lambda calculus to the theory of computation? http://cstheory.stackexchange.com/questions/21705/what-is-the-contribution-of-lambda-calculus-to-the-field-of-theory-of-computatio 47 comments
Lobsters
- What Books Should Everyone Read? https://cstheory.stackexchange.com/questions/3253/what-books-should-everyone-read 17 comments book , compsci
- Computing a 3×3 determinant using < 9 multiplications https://cstheory.stackexchange.com/questions/37017/the-minimum-number-of-arithmetic-operations-to-compute-the-determinant 88 comments compsci
- Does padding with dummies make an NP-problem solvable in fast exponential time? https://cstheory.stackexchange.com/questions/46095/np-hard-problems-with-very-fast-exponential-time-algorithms 2 comments compsci
- Notion of "quotient" or "inverse" for recognizable tree languages? https://cstheory.stackexchange.com/questions/43793/notion-of-quotient-or-inverse-for-recognizable-tree-languages 3 comments compsci
- Improving Bloom filter - can we distinguish elements of a database using less than 2.33275 bits/element? https://cstheory.stackexchange.com/questions/40405/improving-bloom-filter-can-we-distinguish-elements-using-less-than-2-33275-bit 33 comments compsci
- It is settled, Norbert Blum's proof that P does not equal NP is false. https://cstheory.stackexchange.com/questions/38803/is-norbert-blums-2017-proof-that-p-ne-np-correct/38832#comment88852_38832 87 comments compsci
- It is settled, Norbert Blum's proof that P does not equal NP is false. https://cstheory.stackexchange.com/questions/38803/is-norbert-blums-2017-proof-that-p-ne-np-correct/38832#comment88852_38832 53 comments math
- Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers? [with some great answers from the CSTheory community] http://cstheory.stackexchange.com/q/34398/1037 26 comments compsci
- Any theory which computes complexity boundaries like this? http://cstheory.stackexchange.com/questions/33427/is-there-any-theory-that-allows-to-compute-the-computational-complexity-boundari 3 comments compsci
- What CS blogs should everyone read? A suggested list from the community at the cstheory StackExchange. http://cstheory.stackexchange.com/a/22226/1037 9 comments compsci
- Classical computation is about permutation matrices, a subgroup of the unitaries defining quantum computation. Is there computation beyond the unitaries? http://cstheory.stackexchange.com/q/7537/1037/ 8 comments compsci
- Does a noisy version of Conway's game of life support universal computation? http://cstheory.stackexchange.com/q/17914/1037 5 comments compsci
- How to shoot down your proofs: What are your strategies for debugging your arguments? http://cstheory.stackexchange.com/q/6589/1037 3 comments math
- ELI5: P vs. NP problem -- some great explanations from TCS.SE http://cstheory.stackexchange.com/q/5188/1037 32 comments programming
- Interesting results in theoretical computer science which are easily explainable to programmers without a technical background. http://cstheory.stackexchange.com/q/20894/1037/ 9 comments compsci
- Applicability of Church-Turing thesis to interactive models of computation, and Aaronson's Toaster-Enhanced Turing Machine. http://cstheory.stackexchange.com/q/12377/1037 5 comments compsci
- If you could rename dynamic programming, what would you call it? Some history and alternative names: frugal bottom-up recursion, tabulated recursion, memoization, & splice-and-combine. http://cstheory.stackexchange.com/q/5635/1037 11 comments compsci
- Justifying asymptotic worst-case analysis to (non-computer) scientists http://cstheory.stackexchange.com/q/20731/1037 6 comments compsci
- Implications of conjectures in complexity theory conjectures to mathematics outside of computer science http://cstheory.stackexchange.com/q/20550/1037 4 comments compsci
- Standard techniques for formal program verification? http://cstheory.stackexchange.com/questions/20168/what-are-standard-techniques-for-formal-program-verification 4 comments compsci
- What is the enlightenment I'm supposed to attain after studying finite automata? http://cstheory.stackexchange.com/questions/14811/what-is-the-enlightenment-im-supposed-to-attain-after-studying-finite-automata/14818#14818 33 comments programming
- Basic Data Structures and Algorithms in Linux kernel, Chromium, Language Libraries, *nix systems and other practical code http://cstheory.stackexchange.com/questions/19759/core-algorithms-deployed/19773#19773 4 comments programming
- Data Structures/Algorithms in major open source projects http://cstheory.stackexchange.com/a/19773 6 comments compsci
- A list of algorithm success stories. The answers are a good resource for the next time you have to explain why algorithms matters. http://cstheory.stackexchange.com/q/19759/1037 5 comments compsci
- To preventing double spending in decentralized digital currencies like bitcoin, is it necessary for all transactions to be public? http://cstheory.stackexchange.com/q/7145/1037/ 14 comments compsci
- For theoretical computer science, how important is knowing how to program? http://cstheory.stackexchange.com/q/8851/1037/ 12 comments compsci
- Problems whose decidability is not known! http://cstheory.stackexchange.com/q/18846/123 13 comments compsci
- Why Lambda-calculus beats Turing Machines for scientific study of programming languages http://cstheory.stackexchange.com/a/14795/4984 14 comments compsci
- Are Shannon entropy and Boltzmann entropy mutually convertible? http://cstheory.stackexchange.com/questions/12763/are-shannon-entropy-and-boltzmann-entropy-mutually-convertible 5 comments compsci
- What theoretical CS videos should everybody watch? http://cstheory.stackexchange.com/q/1198/1761 17 comments compsci
- Generalizations of binary search for non-linearly ordered sets http://cstheory.stackexchange.com/questions/8923/binary-search-generalizations-for-posets 5 comments programming
- Is real analysis ever used in compsci? http://cstheory.stackexchange.com/questions/4420/mathematical-analysis-and-computational-complexity 31 comments compsci
- Programming language semantics current directions? http://cstheory.stackexchange.com/questions/3533/books-on-programming-language-semantics 6 comments compsci
- Academic CS Humor -- List of Funny Theoretical Computer Science Papers http://cstheory.stackexchange.com/q/3111/351 3 comments programming
- Interesting list of Theoretical Computer Science Papers that you should read http://cstheory.stackexchange.com/questions/1168/what-papers-should-everyone-read 4 comments programming
- major unsolved problems in (theoretical) computer science http://cstheory.stackexchange.com/q/174/123 13 comments compsci
- Factoring and Isomorphism aren't the only problems currently sitting between P (easy) and NP-Complete (hardest) http://cstheory.stackexchange.com/q/79/123 6 comments math
- Algorithms from "The Book"? http://cstheory.stackexchange.com/questions/189/algorithms-from-the-book 9 comments programming
- Stack Exchange -- Theoretical Computer Science Beta now Open! http://cstheory.stackexchange.com/ 8 comments haskell