56 Algorithmic intuition for logarithmic complexity 2012-03-21T05:51:41.653

27 Is there a more intuitive proof of the halting problem's undecidability than diagonalization? 2015-05-20T22:42:49.250

26 Why do we believe that PSPACE ≠ EXPTIME? 2014-12-16T04:00:29.510

23 Rule of thumb to know if a problem could be NP-complete 2012-05-15T18:27:59.127

18 Strategies for becoming unstuck in understanding TCS 2012-03-13T08:04:00.633

17 What are the characteristics of a $\Theta(n \log n)$ time complexity algorithm? 2013-02-25T21:02:00.667

11 Why larger input sizes imply harder instances? 2012-08-13T23:09:10.920

10 What do we gain by having "dependent types"? 2015-03-03T05:19:21.620

9 Turing Recognisable => enumerable 2012-06-05T19:38:42.417

8 How to feel intuitively that a language is regular 2012-06-16T15:32:24.460

7 Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is? 2012-07-20T08:16:19.113

6 Intuition for convolution in image processing 2012-08-16T08:41:24.633

6 How to tell if a language is recognizable, co-recognizable or decidable? 2013-04-22T21:00:40.460

6 Is the following intuition valid for understanding $k$-wise independent hash functions? 2015-12-19T00:44:07.293

5 Visualization of Lamport's three-dimensional "space-time diagram" with introduced "tick lines" 2014-07-23T13:11:22.950

4 An intuitive explanation for LR grammars? 2015-10-21T04:01:01.220

4 Elimination rule for the equality type aka J axiom 2016-02-14T08:11:21.413

4 What is the intuition behind balancing in AVL trees? 2017-03-19T18:05:41.223

4 To what extent is my interpretation of computable numbers correct? 2017-04-15T11:32:41.963

3 What does it mean to multiply or divide polynomials? 2013-09-18T00:11:09.867

3 Given the "programs as proofs" isomorphism, how do we know that the program isn't lying? 2015-03-09T07:59:47.237

3 Why can Multilayer neural networks solve non-linear problems 2015-05-04T13:05:09.197

3 Intuition behind straight-line programs 2017-06-02T23:19:03.830

2 Why is $L= \{ 0^n 1^n | n \geq 1 \}$ not regular language? 2012-05-14T02:35:11.657

2 Why is automatically labeling data in unsupervised learning hard? 2014-06-11T21:23:22.153

1 Real life description for (~A->A)->A 2014-05-28T04:45:51.110

1 How can I use the NP complexity Venn diagram to quickly see which class of NP problem can be poly reducible to another class? 2014-12-16T01:08:39.997

1 Google's Deep Dreamer 2015-07-16T21:21:34.407

1 What does it mean for a problem to be both NP hard and coNP hard 2015-12-02T04:49:04.247

1 Intuitive Explanation on Converting BNF Grammar to LR(1) 2017-03-05T23:20:58.873

1 Of monotone formulas and same ones satisfying certain properties 2017-03-26T07:27:45.077

0 How does selection sort sort? 2015-03-03T20:16:18.093

0 Intuition behind the max-flow min-cut theorem 2015-04-24T10:06:14.260

0 How is the transitive closure of a graph related to PSPACE-completeness? 2017-06-07T01:54:56.310

-1 Learning, understanding and using algorithms 2014-07-04T08:38:05.923