Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.
Awarded 2993 times.
David Deutsch says "number of atoms in universe is finite", but then says "number of programs of all finite lengths is infinite". Contradiction?
Awarded yesterday
Computational complexity of calculating mean vs median?
Awarded Nov 25 at 17:51
The fastest algorithm for intersection of two sorted lists?
Awarded Nov 25 at 1:10
What is instruction throughput and instruction latency?
Awarded Nov 23 at 15:05
Why would we want a self-hosting compiler?
Awarded Nov 22 at 13:21
Randomized and deterministic reduction
Awarded Nov 20 at 14:03
Random sampling in a polygon
Awarded Nov 15 at 18:55
What does it mean to prove the halting problem is undecidable "using arithmetization"?
Awarded Nov 13 at 19:06
Is there a known polynomial time complexity problem with bad constants?
Awarded Nov 12 at 12:50
Is there a known polynomial time complexity problem with bad constants?
Awarded Nov 10 at 21:12
reduction from 3-SAT to Subset Sum problem
Awarded Nov 5 at 19:03
Representing binary functions with a finite gate set without exponential blow-up?
Awarded Nov 3 at 8:17
What is the origin of dot notation?
Awarded Nov 2 at 8:25
Algorithmic Complexity of Recognizing Claw-Free Graphs
Awarded Nov 1 at 20:42
What are the real world applications of set cover problem?
Awarded Oct 27 at 5:15
Peer grading design - choosing a graph, to get accurate rankings/ratings
Awarded Oct 25 at 18:58
Sorting functions by asymptotic growth
Awarded Oct 19 at 11:09
Can a graph problem remain NP-hard when restricted to cycle graphs?
Awarded Oct 10 at 23:41
"partial sorting" algorithms (aka "partitioning")
Awarded Sep 26 at 15:47
Does the Y combinator contradict the Curry-Howard correspondence?
Awarded Sep 19 at 11:27
What was the first programming language with loop break?
Awarded Sep 16 at 10:42
Time Complexity of Linear Search vs Brute Force
Awarded Sep 15 at 14:08
Is reference counting GC vs. tracing GC a language property or an implementation property?
Awarded Sep 15 at 12:32
Why isn't the Swift programming language type inference more aggressive?
Awarded Sep 15 at 12:32
Is the language given by the regex (ab)* star-free?
Awarded Sep 12 at 8:15
Does the first incompleteness theorem imply that any Turing complete programming language must have undefined behavior?
Awarded Sep 9 at 11:41
Lower bounds: queues that return their min elements in $O(1)$ time
Awarded Sep 4 at 19:40
The difference between a sequence and a set
Awarded Aug 27 at 16:41
Why are computability problems always written in full caps?
Awarded Aug 26 at 9:57
Why are computability problems always written in full caps?
Awarded Aug 24 at 12:32
Is English Turing-complete?
Awarded Aug 23 at 20:26
What are the conditions necessary for a programming language to have no undefined behavior?
Awarded Aug 20 at 4:36
Can we ever achieve Turing completeness?
Awarded Aug 18 at 17:18
Why are Chess, Mario, and Go not NP-complete?
Awarded Aug 14 at 8:48
Teaching NP-completeness - Turing reductions vs Karp reductions
Awarded Aug 10 at 21:11
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?
Awarded Aug 10 at 14:09
Is the 0-1 Knapsack problem where value equals weight NP-complete?
Awarded Aug 9 at 8:04
Is there an efficient algorithm to find whether an integer is a prime power?
Awarded Aug 4 at 0:49
Is significand same as mantissa in IEEE754?
Awarded Aug 2 at 23:35
Is there an efficient algorithm to find whether an integer is a prime power?
Awarded Aug 1 at 21:15
Do passwords need a max length?
Awarded Jul 27 at 0:45
Why, really, is the Halting Problem so important?
Awarded Jul 23 at 4:07
Introduction into first order logic verification
Awarded Jul 20 at 1:07
Choosing a subset to maximize the minimum distance between points
Awarded Jul 5 at 11:57
How AlphaDev improved sorting algorithms?
Awarded Jun 29 at 16:25
How AlphaDev improved sorting algorithms?
Awarded Jun 29 at 1:55
Why are Chess, Mario, and Go not NP-complete?
Awarded Jun 26 at 22:51
NP-Hard problems that are not in NP but decidable
Awarded Jun 26 at 8:33
How does the TLB identify a particular process?
Awarded Jun 26 at 6:12
In Agda's GADT, are "parameterized" and "indexed" different semantically?
Awarded Jun 24 at 16:31
Is a machine Turing-complete when it can decide a context-sensitive language?
Awarded Jun 14 at 3:57
Is there an example of a recursive language which is not context sensitive?
Awarded Jun 13 at 16:12
Strict positivity
Awarded Jun 11 at 12:06
False proofs that look correct
Awarded Jun 10 at 12:47
False proofs that look correct
Awarded Jun 9 at 14:45
Are there any type constructors which are *not* functors?
Awarded Jun 6 at 17:12
Find a weighted median for unsorted array in linear time
Awarded Jun 4 at 10:21
Are "computable problem" and "computable function" the same thing?
Awarded May 30 at 16:43
How can I convert the Turing machine the recognizes language $L$ into an unrestricted grammar?
Awarded May 28 at 5:44
Are all DFAs also NFAs?
Awarded May 27 at 3:27
1
2 3 4 5
…
50

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.