User usul

22 votes

Accepted

Did Alan Turing's student Robin Gandy assert that Charles Babbage had no notion of a universal computing machine?

answered Sep 3, 2019 at 15:31

22 votes

Accepted

Implications of proving NP=RP on complexity theory

answered Aug 5, 2020 at 4:51

20 votes

Examples of successful derandomization from BPP to P

answered Mar 23, 2016 at 14:40

20 votes

Accepted

Is BPP vs. P a real problem after we know BPP lies in P/poly?

answered Oct 6, 2017 at 21:02

19 votes

Accepted

Is it enough for linear program constraints to be satisfied in expectation?

answered Dec 10, 2012 at 6:16

17 votes

Accepted

What is a natural problem in theory of computation?

answered Aug 25, 2019 at 6:07

16 votes

Accepted

Are vertex colourings--in a sense--edge colourings?

answered Feb 18, 2013 at 4:47

16 votes

Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?

answered May 17, 2015 at 9:15

14 votes

Does Memcomputing really solve an NP-complete problem?

answered Jan 26, 2017 at 19:06

14 votes

Accepted

White elephant gift exchanges: mechanisms for fair division

answered Dec 15, 2012 at 18:49

13 votes

Accepted

Why economists should care about computational complexity

answered May 9, 2013 at 0:21

12 votes

What is theoretical computer science?

answered Nov 3, 2013 at 19:57

12 votes

Arguments for/against Kolmogorov's conjecture about the circuit complexity of P

answered May 7, 2014 at 21:56

12 votes

Accepted

if I were to define a new complexity class how should I start?

answered May 14, 2014 at 3:03

11 votes

What are examples of recent relatively simple 'toolbox algorithms'?

answered Aug 6 at 11:08

10 votes

What are examples of recent relatively simple 'toolbox algorithms'?

answered Aug 6 at 10:57

10 votes

Accepted

Find research partner (profession and beginner)

answered Jun 2, 2021 at 13:47

10 votes

Accepted

Can limit of hard languages be easy?

answered Feb 1, 2014 at 1:19

10 votes

Is there a non-deterministic version of the complexity class PP?

answered Oct 15, 2018 at 5:17

10 votes

Accepted

What's the complexity of counting odd nodes in graph?

answered Oct 25, 2015 at 0:04

10 votes

Misunderstanding the Church-Turing thesis?

answered Jan 8, 2016 at 1:26

9 votes

Using Kolmogorov complexity as input "size"

answered Mar 1, 2014 at 10:49

9 votes

Why exactly are complexity theorists interested in closed timelike curves?

answered May 21, 2019 at 4:23

8 votes

Sum of products of all combinations?

answered Jun 18, 2014 at 21:35

8 votes

Candidates for One-Way Function

answered Jun 27, 2014 at 18:00

8 votes

Accepted

How to be formal while writing papers?

answered Sep 4, 2016 at 23:28

7 votes

Collection of failed attempts to solve X

answered May 13, 2016 at 4:04

7 votes

Accepted

Would a proof assuming a physical law be considered sufficient?

answered Aug 23, 2015 at 17:07

7 votes

How much would a SAT oracle help speeding up polynomial time algorithms?

answered Sep 29, 2015 at 11:13

7 votes

Examples of $\Sigma_2^p$ complete problems?

answered Jun 30, 2014 at 21:22

Stack Exchange Network

102 Answers

Did Alan Turing's student Robin Gandy assert that Charles Babbage had no notion of a universal computing machine?

Implications of proving NP=RP on complexity theory

Examples of successful derandomization from BPP to P

Is BPP vs. P a real problem after we know BPP lies in P/poly?

Is it enough for linear program constraints to be satisfied in expectation?

What is a natural problem in theory of computation?

Are vertex colourings--in a sense--edge colourings?

Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?

Does Memcomputing really solve an NP-complete problem?

White elephant gift exchanges: mechanisms for fair division

Why economists should care about computational complexity

What is theoretical computer science?

Arguments for/against Kolmogorov's conjecture about the circuit complexity of P

if I were to define a new complexity class how should I start?

What are examples of recent relatively simple 'toolbox algorithms'?

What are examples of recent relatively simple 'toolbox algorithms'?

Find research partner (profession and beginner)

Can limit of hard languages be easy?

Is there a non-deterministic version of the complexity class PP?

What's the complexity of counting odd nodes in graph?

Misunderstanding the Church-Turing thesis?

Using Kolmogorov complexity as input "size"

Why exactly are complexity theorists interested in closed timelike curves?

Sum of products of all combinations?

Candidates for One-Way Function

How to be formal while writing papers?

Collection of failed attempts to solve X

Would a proof assuming a physical law be considered sufficient?

How much would a SAT oracle help speeding up polynomial time algorithms?

Examples of $\Sigma_2^p$ complete problems?