Computer Science

Good Answer

 Good Answer
Answer score of 25 or more. This badge can be awarded multiple times.
Awarded 584 times.
Enumerate all non-isomorphic graphs of a certain size
Awarded Sep 16 at 0:50
Why are computability problems always written in full caps?
Awarded Sep 5 at 11:57
What is coinduction?
Awarded Aug 25 at 4:05
Can we ever achieve Turing completeness?
Awarded Aug 19 at 14:25
How does Tarjan's pseudocode work (explained to someone familiar with C or Java)?
Awarded Aug 10 at 14:17
Does space complexity analysis usually include output space?
Awarded Jul 21 at 23:26
Strict positivity
Awarded Jun 11 at 12:06
Longest path in an undirected tree with only one traversal
Awarded May 29 at 8:16
Does the Turing test have anything to do with Turing completeness or Turing machines?
Awarded May 15 at 17:41
Are there any countable sets that are not computably enumerable?
Awarded May 7 at 4:12
Is there a "Standard Algorithm" language, as used in academic papers?
Awarded Mar 16 at 17:31
Is there a "Standard Algorithm" language, as used in academic papers?
Awarded Mar 16 at 12:17
Is there a physical analogy to the Turing Machine?
Awarded Feb 19 at 20:26
Prove that every two longest paths have at least one vertex in common
Awarded Dec 1, 2022 at 8:05
Real life examples of *zero* weight edges in graphs
Awarded Nov 27, 2022 at 12:35
Is there a faster than O(n^2) way to compute a vector of length n from another vector and an n by n matrix?
Awarded Sep 29, 2022 at 19:56
What is a CPU clock physically?
Awarded Aug 25, 2022 at 0:11
Why do we rely on computers in critical fields?
Awarded Aug 2, 2022 at 0:06
What classes of data structures can be made persistent?
Awarded Jul 23, 2022 at 16:33
Is there a PRNG that visits every number exactly once, in a non-trivial bitspace, without repetition, without large memory usage, before it cycles?
Awarded Jul 22, 2022 at 1:18
How to show that L = L(G)?
Awarded Jul 17, 2022 at 12:56
Array access is O(1) implies a fixed index size, which implies O(1) array traversal?
Awarded Jun 26, 2022 at 15:56
What is the most efficient algorithm to compute polynomial coefficients from its roots?
Awarded Jun 21, 2022 at 17:42
Is it provably true/false that for a program, there exists a proof whether it halts or not?
Awarded Jun 7, 2022 at 22:17
How to calculate the number of tag, index and offset bits of different caches?
Awarded Jun 7, 2022 at 10:51
How to map the tapes of a "k-tape" Turing Machine into the single tape of a "1-tape" Turing Machine
Awarded May 30, 2022 at 8:18
Is the open question NP=co-NP the same as P=NP?
Awarded Apr 29, 2022 at 4:09
Proving Equivalence of Two Regular Expressions
Awarded Apr 24, 2022 at 8:11
What is the advantage of heaps over sorted arrays?
Awarded Apr 18, 2022 at 11:06
Why are functional languages Turing complete?
Awarded Apr 14, 2022 at 13:20
Could Gödel’s incompleteness theorem be circumvented with a quine?
Awarded Apr 12, 2022 at 2:15
"partial sorting" algorithms (aka "partitioning")
Awarded Apr 8, 2022 at 16:40
What is the Relationship Between Programming Languages, Regular Expressions and Formal Languages
Awarded Apr 4, 2022 at 0:07
Could Gödel’s incompleteness theorem be circumvented with a quine?
Awarded Mar 14, 2022 at 19:01
Why does Coq include let-expressions in its core language
Awarded Mar 3, 2022 at 18:42
What are GPUs bad at?
Awarded Feb 13, 2022 at 6:57
How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?
Awarded Feb 6, 2022 at 21:17
How to implement a Prolog interpreter in a purely functional language?
Awarded Jan 25, 2022 at 4:42
Practical importance of Turing machines?
Awarded Jan 24, 2022 at 14:42
Shor's Algorithm speed
Awarded Jan 8, 2022 at 20:27
How many different max-heaps exist for a list of n integers?
Awarded Jan 5, 2022 at 5:40
Why is tail recursion better than regular recursion?
Awarded Jan 1, 2022 at 21:52
Problems that are polynomially "hard" to compute but "easy" to verify
Awarded Dec 28, 2021 at 19:32
Is there an algorithm whose time complexity is between polynomial time and exponential time？
Awarded Dec 25, 2021 at 9:01
What are some interesting/important Programming Language Concepts I could teach myself in the coming semester?
Awarded Dec 15, 2021 at 10:47
Why are graphs represented as adjacency lists instead of adjacency sets?
Awarded Dec 12, 2021 at 17:46
Real life examples of negative weight edges in graphs
Awarded Dec 3, 2021 at 22:00
Data structure for fast insertion and fast random element removal
Awarded Nov 25, 2021 at 1:12
Why is writing down mathematical proofs more fault-proof than writing computer code?
Awarded Nov 24, 2021 at 23:23
What determines the "speed" of a programming language?
Awarded Nov 21, 2021 at 2:19
Is a computer without RAM, but with a disk, equivalent to one with RAM?
Awarded Nov 8, 2021 at 1:51
What is meant by "solvable by non deterministic algorithm in polynomial time"
Awarded Nov 3, 2021 at 8:12
Difference between regular expression and grammar in automata
Awarded Oct 19, 2021 at 13:16
What does 'true concurrency' mean?
Awarded Oct 10, 2021 at 18:17
Is there a difference between perfect, full and complete tree?
Awarded Oct 10, 2021 at 7:50
Would it be wrong to say that the processor (and hardware) is the implementation of an interpreter for machine language?
Awarded Sep 22, 2021 at 13:32
Justification for neglecting constant factors in Big O
Awarded Sep 15, 2021 at 19:11
Are there any problems that are easy to compute but hard to verify?
Awarded Sep 13, 2021 at 10:20
What are the conditions for a NFA for its equivalent DFA to be maximal in size?
Awarded Sep 5, 2021 at 16:21
Example of a graph with negative weighed edges in which Dijkstra's algorithm does work
Awarded Aug 20, 2021 at 16:10
1
2 3 4 5
…
10

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.