user avatar
user avatar
user avatar
Discrete lizard
Moderator
  • Member for 5 years, 5 months
  • Last seen this week
  • At location (3,4) in a spacious terrarium (somewhere in the Netherlands)
62 votes

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

28 votes
Accepted

Turing machine + time dilation = solve the halting problem?

20 votes
Accepted

What kind of math problems can be solved by automated theorem provers?

18 votes

Does this article imply that Turing-Computability is not the same as "effectively computable"?

17 votes

Why do ¬, ∀ and ∃ have the same precedence?

13 votes

What is a 'Key' in computer science?

12 votes
Accepted

Naive argument that P ≠ NP

11 votes

What exactly is the semantic difference between set and type?

8 votes
Accepted

What is a fractional matching?

8 votes
Accepted

Why is a sequence of n Push, Pop, Multipop operations O(n²)?

8 votes
Accepted

Reservoir sampling algorithm probability

7 votes
Accepted

Does P = NP in Cellular Automata of Hyperbolic Spaces?

6 votes
Accepted

Is there an NP-hard problem for which no Fixed-Parameter Tractable algorithm exists?

6 votes
Accepted

Are there any known W[3] or W[3]-hard problems?

6 votes
Accepted

How to check if a specific ILP problem can be solved in polynomial time or not?

6 votes
Accepted

Solving diophantine equations -- does having a bound on the size of the solution help?

6 votes
Accepted

King of the North: Placing bannermen surrounding castle

5 votes

What is the complement of Halting Problem?

5 votes

Why is the set for which a decision problem is true called a "language"?

5 votes

How does matrix chain multiplication problem has an optimal substructure?

5 votes
Accepted

Imaginary numbers and negative zero

5 votes

Is "Reachable Object" really an NP-complete problem?

5 votes

What's the flaw in the P != NP proof in the article "The Computational Complexity of the Traveling Salesman Problem"

5 votes
Accepted

Is the differential privacy definition with lower and upper bound equivalent to the definition with just an upper bound?

4 votes

Example of a graph with negative weighed edges in which Dijkstra's algorithm does work

4 votes

Is there a formal definition of sub-instances or sub-problems?

4 votes
Accepted

Invariant vs Assertion vs lemma

4 votes
Accepted

How to calculate the dimension of a convex polyhedron?

4 votes
Accepted

Basic second-order logic example contains a mistake?

4 votes
Accepted

How to find vertices of bounded region made by intersection of lines

1
2 3 4 5 6