Skip to main content
Yuval Filmus's user avatar
Yuval Filmus's user avatar
Yuval Filmus's user avatar
Yuval Filmus
  • Member for 12 years, 2 months
  • Last seen this week
251 votes

Why is writing down mathematical proofs more fault-proof than writing computer code?

87 votes
Accepted

Keeping a String Secret in (Open) Source Code

78 votes

Does $\mathsf{P} \ne \mathsf{NP}$ imply that $|\mathsf{NP}| > |\mathsf{P}|$?

76 votes
Accepted

Can a computer determine whether a mathematical statement is true or not?

63 votes
Accepted

Boolean search explained

59 votes

Why is the Turing Machine a popular model of computation?

57 votes
Accepted

Why are ambiguous grammars bad?

55 votes

Minimum spanning tree vs Shortest path

52 votes
Accepted

What exactly is polynomial time?

51 votes

Example of an algorithm that lacks a proof of correctness

50 votes

Time complexity of an algorithm: Is it important to state the base of the logarithm?

48 votes

Why is $A \lor (A \land \neg B) \equiv A$?

47 votes
Accepted

Why is SAT so important in theoretical computer science?

44 votes
Accepted

Quantum Computing and Turing Machines: Are Turing Machines still an Accurate Measure?

42 votes
Accepted

How does a computer determine the data type of a byte?

41 votes

Would the P vs. NP problem become trivial as a result of the development of universal quantum computers?

40 votes

Can Quantum Computing solve Problems not even a Turing Machine can solve?

40 votes

Simple (non-mathematical) definition of polynomial time?

39 votes

Are all pseudo-random number generators ultimately periodic?

39 votes
Accepted

What is the definition of Computer Science, and what is the Science within Computer Science?

39 votes

Could Gödel’s incompleteness theorem be circumvented with a quine?

38 votes
Accepted

How can a computer deal with real numbers

37 votes
Accepted

Are there any functions with Big O (Busy Beaver(n))?

36 votes

Are algorithms (and efficiency in general) getting less important?

36 votes

Is busy beaver the fastest growing function known to man?

36 votes

What would be the real-world implications of a constructive $P=NP$ proof?

36 votes
Accepted

Planar regular languages

35 votes

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

35 votes
Accepted

"Dense" regular expressions generate $\Sigma^*$?

35 votes

Iteration can replace Recursion?

1
2 3 4 5
233