Display options

You can modify the default view of progscrape using query parameters.

Feedback? Email [email protected]

progscrape https://progscrape.com/
Trending tags: github.com  ai  rust  health  google  youtube.com  show  video  techcrunch.com  javascript  go  apple  release  web  nature.com  eurekalert.org  china  trump  arstechnica.com  nytimes.com 

Is C99 actually Turing-complete?

3 months ago cs.stackexchange.com

Why are computability problems always written in full caps?

15 months ago cs.stackexchange.com compsci historical

Reference request: is there a proof of correctness for CPS translations into Appel's IR?

17 months ago cs.stackexchange.com compiler

Are there NP COMPLETE problems that are "easy" in practice?

18 months ago cs.stackexchange.com

Reference request: Compiler optimization pass joining identical function definitions together (or specializing them)

18 months ago cs.stackexchange.com compiler

Which maintainability metric has the strongest empirical evidence?

3 years ago cs.stackexchange.com

What [empirical] evidence do we have for or against a correlation between fault density and LOC?

3 years ago cs.stackexchange.com

Why is quicksort better than other sorting algorithms in practice? (2013)

4 years ago cs.stackexchange.com algorithm

How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect

5 years ago cs.stackexchange.com algorithm

How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?

5 years ago cs.stackexchange.com c java

Why are Buchi automata factorially succinct when compared to Rabin Automata?

6 years ago cs.stackexchange.com

Can proof by contradiction work without the law of excluded middle?

6 years ago cs.stackexchange.com

Why is writing mathematical proofs more fault-proof than writing code? (2011)

6 years ago cs.stackexchange.com

What are the reasons to learn different algorithms / data structures serving the same purpose?

6 years ago cs.stackexchange.com algorithm

Why is static-single assignment preferred over continuation passing style in many industry-used compilers?

7 years ago cs.stackexchange.com compiler

Is every NP-hard problem computable?

7 years ago cs.stackexchange.com

Why are some programming languages "faster" or "slower" than others?

7 years ago cs.stackexchange.com

Why, really, is the Halting Problem so important?

7 years ago cs.stackexchange.com

Can I think of NP using a parallelism model?

8 years ago cs.stackexchange.com

How to implement a prolog interpreter in a purely functional language?

8 years ago cs.stackexchange.com prolog

Efficient algorithm for this optimization problem? Dynamic programming?

9 years ago cs.stackexchange.com algorithm