Skip to main content
Computer Science

Favorite Question

 Favorite Question
Question saved by 25 users. This badge can be awarded multiple times.
Awarded 89 times.
How do Functional Reactive Programming and the Actor model relate to each other?
Awarded Jul 21 at 17:09
Why don't compilers automatically insert deallocations?
Awarded May 11 at 9:10
Longest path in an undirected tree with only one traversal
Awarded Apr 22 at 13:35
Clear, intuitive derivation of the fixed-point combinator (Y combinator)?
Awarded Feb 19, 2023 at 22:10
Why would anyone want CISC?
Awarded Mar 13, 2022 at 6:05
Are there subexponential-time algorithms for NP-complete problems?
Awarded Dec 28, 2021 at 13:00
What exactly is the semantic difference between set and type?
Awarded Nov 13, 2021 at 5:11
Algorithm books on a range of topics
Awarded Oct 27, 2021 at 0:26
Perplexed by Rice's theorem
Awarded Sep 23, 2021 at 22:35
Can a public key be used to decrypt a message encrypted by the corresponding private key?
Awarded Sep 19, 2021 at 19:26
What happens to the cache contents on a context switch?
Awarded Sep 6, 2021 at 4:46
How are variables stored in and retrieved from the program stack?
Awarded Jul 26, 2021 at 4:41
How do computers keep track of time?
Awarded May 7, 2021 at 19:50
What would be the real-world implications of a constructive $P=NP$ proof?
Awarded Apr 6, 2021 at 5:20
In-place algorithm for interleaving an array
Awarded Feb 6, 2021 at 20:05
How to prove greedy algorithm is correct
Awarded Dec 20, 2020 at 13:25
Show that { xy ∣ |x| = |y|, x ≠ y } is context-free
Awarded Dec 3, 2020 at 5:05
Algorithm that finds the number of simple paths from $s$ to $t$ in $G$
Awarded Oct 29, 2020 at 3:36
Algorithm to find diameter of a tree using BFS/DFS. Why does it work?
Awarded Oct 14, 2020 at 10:40
Floyd's Cycle detection algorithm | Determining the starting point of cycle
Awarded Sep 18, 2020 at 20:41
Find median of unsorted array in $O(n)$ time
Awarded Aug 17, 2020 at 14:21
The math behind converting from any base to any base without going through base 10?
Awarded May 31, 2020 at 9:42
Intro to Martin-Löf type theory
Awarded Apr 20, 2020 at 0:28
Deciding on Sub-Problems for Dynamic Programming
Awarded Apr 19, 2020 at 16:30
Minimum spanning tree vs Shortest path
Awarded Apr 14, 2020 at 17:25
What are GPUs bad at?
Awarded Mar 1, 2020 at 4:25
Factorial algorithm more efficient than naive multiplication
Awarded Feb 6, 2020 at 12:35
Knapsack problem -- NP-complete despite dynamic programming solution?
Awarded Dec 30, 2019 at 4:15
Generalised 3SUM (k-SUM) problem?
Awarded Dec 26, 2019 at 7:05
How do O and Ω relate to worst and best case?
Awarded Dec 10, 2019 at 7:35
Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?
Awarded Oct 13, 2019 at 16:05
Is there any concrete relation between Gödel's incompleteness theorem, the halting problem and universal Turing machines?
Awarded Aug 8, 2019 at 14:05
Are there minimum criteria for a programming language being Turing complete?
Awarded Feb 11, 2019 at 7:05
What important/crucial real-world applications use blockchain?
Awarded Jan 9, 2019 at 15:20
How to prove a language is regular?
Awarded Dec 29, 2018 at 6:05
Dependent types vs refinement types
Awarded Nov 25, 2018 at 5:45
How do I construct reductions between problems to prove a problem is NP-complete?
Awarded Nov 16, 2018 at 11:00
Dealing with intractability: NP-complete problems
Awarded Oct 23, 2018 at 18:10
Why is the Turing Machine a popular model of computation?
Awarded Jul 1, 2018 at 2:19
What is the difference between an algorithm, a language and a problem?
Awarded May 31, 2018 at 9:24
What properties of a programming language make compilation impossible?
Awarded Apr 17, 2018 at 10:02
Express boolean logic operations in zero-one integer linear programming (ILP)
Awarded Apr 9, 2018 at 23:01
Why is it best to use a prime number as a mod in a hashing function?
Awarded Apr 1, 2018 at 20:05
Sorting functions by asymptotic growth
Awarded Mar 13, 2018 at 0:17
Why does a processor have 32 registers?
Awarded Feb 8, 2018 at 23:12
Learning Automated Theorem Proving
Awarded Jan 19, 2018 at 5:31
Why is addition as fast as bit-wise operations in modern processors?
Awarded Dec 21, 2017 at 12:49
Language theoretic comparison of LL and LR grammars
Awarded Dec 16, 2017 at 7:18
Why is writing down mathematical proofs more fault-proof than writing computer code?
Awarded Dec 12, 2017 at 20:52
How to show that a function is not computable? How to show a language is not computably enumerable?
Awarded Nov 25, 2017 at 7:30
What are common techniques for reducing problems to each other?
Awarded Oct 31, 2017 at 15:50
Contrasting Peterson’s and Dekker’s algorithms
Awarded Oct 25, 2017 at 22:15
Difference between Parallel and Concurrent programming?
Awarded Aug 26, 2017 at 23:26
What is tail recursion?
Awarded Jul 22, 2017 at 21:14
Formal program verification in practice
Awarded Jul 21, 2017 at 17:49
What's the difference between a binary search tree and a binary heap?
Awarded Jun 13, 2017 at 12:32
Which machine learning algorithms can be used for time series forecasts?
Awarded May 26, 2017 at 18:33
Why is deep learning hyped despite bad VC dimension?
Awarded May 15, 2017 at 11:51
What are the reasons to learn different algorithms / data structures serving the same purpose?
Awarded Apr 16, 2017 at 1:38
Why are some programming languages "faster" or "slower" than others?
Awarded Mar 27, 2017 at 20:52
1
2