user avatar
user avatar
user avatar
Philip White
  • Member for 11 years, 11 months
  • Last seen this week
17 votes

Explain P = NP problem to 10 year old

9 votes

Interesting results in TCS which are easily explainable to programmers without technical background

9 votes

Resources to learn about the P vs. NP problem

6 votes

Is there an alternative proof of the TM Halting Problem other than the "standard" one?

5 votes

Deciding whether a turning machine guaranteed to halt solves sat

5 votes

Is relativization well-defined?

4 votes
Accepted

Clarification: Are runtime bounds in P decidable?

4 votes
Accepted

Choosing a research topic using game theory

4 votes

Is embedding a solution feasible for SAT?

3 votes

Are there any proofs the undecidability of the halting problem that does not depend on self-referencing or diagonalization ?

3 votes

Turing machines whose termination is unprovable?

2 votes

Does this problem related to subset sum have a name?

1 vote

Factoring semiprimes whose factors very close to a power of two

1 vote

What is the simplest known solver for a np-complete problem?

1 vote

Computationally bounded version of Nash equilibrium?

1 vote
Accepted

Is where an oracle B in EXP that $P^B$ $ \ne$ $NP^B$?

1 vote

Impossibility in Computability and Complexity: always ultimately due to diagonal arguments?

0 votes

Random self reducibility and NP

0 votes

Is logic in computation of computation constructivist?

-1 votes

Proving properties about a compilation from one problem into another

-1 votes

Is there a result in computability theory that does not relativize?

-2 votes

Algorithm to find all combinations

-3 votes

Polytime reduction to factoring variant of subset sum

-3 votes

Fixed parameter tractability