User D.W.

112 votes

Accepted

How do computers keep track of time?

answered Mar 25, 2016 at 18:22

109 votes

Accepted

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

answered May 24, 2017 at 2:42

100 votes

What is a safe programming language?

answered Jul 3, 2018 at 6:30

96 votes

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

answered May 18, 2013 at 15:31

88 votes

Accepted

Why can humans solve certain "undecidable" problems?

answered Sep 29, 2015 at 23:27

76 votes

Accepted

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

answered Mar 27, 2018 at 15:35

70 votes

Why is deep learning hyped despite bad VC dimension?

answered May 14, 2017 at 1:54

52 votes

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

answered Apr 5, 2018 at 16:26

48 votes

Accepted

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

answered Mar 4, 2016 at 23:11

47 votes

Accepted

Is a universal assembly language for all computers possible?

answered Sep 7, 2015 at 16:58

47 votes

Accepted

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

answered Nov 28, 2015 at 5:24

46 votes

Why do we not combine random number generators?

answered May 20, 2016 at 2:55

45 votes

Efficient compression of simple binary data

answered May 7, 2017 at 16:26

44 votes

Accepted

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

answered Jun 21, 2018 at 3:17

42 votes

Accepted

Understanding serialization

answered Mar 27, 2017 at 6:15

41 votes

How to prove greedy algorithm is correct

answered Jun 30, 2016 at 0:09

40 votes

Accepted

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

answered Jan 2, 2016 at 4:28

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?

answered Jul 19, 2022 at 19:59

38 votes

Accepted

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

answered May 14 at 1:45

38 votes

Accepted

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

answered Feb 20, 2015 at 17:58

38 votes

Accepted

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

answered Jan 25, 2021 at 2:20

36 votes

Accepted

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

answered Nov 7, 2016 at 23:52

35 votes

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

answered Apr 20, 2017 at 20:37

34 votes

Accepted

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

answered Dec 27, 2021 at 1:32

32 votes

Accepted

What is dynamic programming about?

answered Sep 15, 2015 at 20:20

31 votes

Accepted

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

answered Jun 23, 2022 at 23:59

30 votes

Accepted

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

answered Mar 13 at 20:26

30 votes

Accepted

Program Correctness, The specification

answered Feb 8, 2017 at 16:55

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?

answered Sep 28, 2022 at 7:06

30 votes

Accepted

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

answered Mar 15, 2019 at 8:19

Stack Exchange Network

4,567 Answers

How do computers keep track of time?

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

What is a safe programming language?

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

Why can humans solve certain "undecidable" problems?

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

Why is deep learning hyped despite bad VC dimension?

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

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

Is a universal assembly language for all computers possible?

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

Why do we not combine random number generators?

Efficient compression of simple binary data

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

Understanding serialization

How to prove greedy algorithm is correct

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

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

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

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

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

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

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

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

What is dynamic programming about?

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

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

Program Correctness, The specification

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?

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