Skip to main content
D.W.'s user avatar
D.W.'s user avatar
D.W.'s user avatar
D.W.
Moderator
  • Member for 12 years, 3 months
  • Last seen this week
114 votes
Accepted

How do computers keep track of time?

111 votes
Accepted

Why is addition as fast as bit-wise operations in modern processors?

100 votes

Express boolean logic operations in zero-one integer linear programming (ILP)

100 votes

What is a safe programming language?

89 votes
Accepted

Why can humans solve certain "undecidable" problems?

78 votes
Accepted

Is von Neumann's randomness in sin quote no longer applicable?

71 votes

Why is deep learning hyped despite bad VC dimension?

52 votes

Why can we assume an algorithm can be represented as a bit string?

48 votes
Accepted

Is there anything that MUST be done on a multi-core CPU?

48 votes
Accepted

Is a universal assembly language for all computers possible?

47 votes
Accepted

Is there a known maximum for how much a string of 0's and 1's can be compressed?

45 votes

Why do we not combine random number generators?

44 votes

How to prove greedy algorithm is correct

44 votes

Efficient compression of simple binary data

44 votes
Accepted

Will hardware/implementation affect the time/space complexity of algorithms?

42 votes
Accepted

Understanding serialization

40 votes
Accepted

Are there any problems that get easier as they increase in size?

39 votes
Accepted

Is there a PRNG that visits every number exactly once, in a non-trivial bitspace, without repetition, without large memory usage, before it cycles?

38 votes
Accepted

Hardness of a problem which is the sum of two NP-Hard problems

38 votes
Accepted

Does the Turing test have anything to do with Turing completeness or Turing machines?

38 votes
Accepted

How can I academically say that 'one computer is slower than the other'?

36 votes
Accepted

Why there are no approximation algorithms for SAT and other decision problems?

35 votes

3SAT solvable in polynomial time...but with exponential tuning?

34 votes
Accepted

Problems that are polynomially "hard" to compute but "easy" to verify

32 votes
Accepted

What is dynamic programming about?

31 votes
Accepted

Program Correctness, The specification

31 votes
Accepted

Array access is O(1) implies a fixed index size, which implies O(1) array traversal?

30 votes
Accepted

Is there a "Standard Algorithm" language, as used in academic papers?

30 votes
Accepted

Is there a faster than O(n^2) way to compute a vector of length n from another vector and an n by n matrix?

30 votes
Accepted

If I can solve Sudoku, can I solve the Travelling Salesman Problem (TSP)? If so, how?

1
2 3 4 5
159