Skip to main content
Computer Science

Nice Question

 Nice Question
Question score of 10 or more. This badge can be awarded multiple times.
Awarded 1907 times.
Why is static recompilation not possible?
Awarded Sep 1 at 13:40
A Turing machine with each cell accessed at most $10$ times has an equivalent NFA
Awarded Aug 29 at 13:15
Are all undecidable/uncomputable problems reducible to the Halting problem? [duplicate]
Awarded Aug 28 at 13:33
Arbitrary precision integer square root algorithm?
Awarded Aug 23 at 20:25
Are there any problems in $P$ which we do not know any $P$ algorithms?
Awarded Aug 22 at 12:01
What is a good algorithm for generating random DFAs?
Awarded Aug 15 at 0:06
What is so fundamental about polynomial functions that they are used to demarcate the Hardness boundary in NP complexity classes?
Awarded Aug 2 at 7:40
Is non-determinism in a non-deterministic turing machine different from that of finite automata and push down automata?
Awarded Aug 1 at 14:13
Why is Oracle Turing Machine important?
Awarded Jul 31 at 13:31
Understanding denormalized numbers in floating point representation
Awarded Jul 27 at 13:35
Are there any functions with Big O (Busy Beaver(n))?
Awarded Jul 24 at 10:56
3-SAT for variables appearing 3 times
Awarded Jul 19 at 9:27
What's the difference between: operational, denotational and axiomatic semantics?
Awarded Jul 17 at 12:40
Is there a simple argument why graph isomorphism is not NP-complete?
Awarded Jul 15 at 20:15
What exactly is Symbolic Model Checking?
Awarded Jul 4 at 11:17
Circles covering a rectangular, how to verify it?
Awarded Jun 30 at 7:53
What is the complexity for the universality problem for a NFA with all states accepting?
Awarded Jun 1 at 15:48
Counting and finding all perfect/maximum matchings in general graphs
Awarded May 27 at 10:55
Importance of the empty string
Awarded May 26 at 0:51
Why are search problems assumed to have the structure of "find a path in a graph"?
Awarded May 17 at 7:06
Prove or refute: BPP(0.90,0.95) = BPP
Awarded May 16 at 15:42
What is instruction throughput and instruction latency?
Awarded May 15 at 10:42
Proof that TAUT is coNP-complete (or that a problem is coNP-complete if its complement is NP-complete)
Awarded May 10 at 22:41
Conditions for bipartite graph to be planar with no edges going around the vertices
Awarded May 7 at 17:15
Why are most (or all?) polynomial time algorithms practical?
Awarded Apr 20 at 14:56
If $L_1L_2$ is regular language then is $L_2L_1$ regular too?
Awarded Apr 14 at 3:46
Infinite alphabet Turing Machine
Awarded Apr 11 at 22:03
BFGS vs L-BFGS -- how different are they really?
Awarded Apr 8 at 12:56
Finding MST after adding a new vertex
Awarded Apr 2 at 4:10
Using naturality to prove $f: \forall\alpha. \alpha\times\alpha\to\alpha$ must be a projection
Awarded Mar 27 at 23:35
How do C compilers distinguish casting from grouping?
Awarded Mar 27 at 1:55
Decidability of halting problem for DPDAs with $\epsilon$-transitions?
Awarded Mar 23 at 20:26
is $P_{CTC} = BPP_{path}$?
Awarded Mar 17 at 1:57
Are there languages L1 ⊆ L2 ⊆ L3 when L1 and L3 are NP-Complete languages and L2 ∈ P?
Awarded Mar 14 at 18:56
Does every problem in NP have an exponential time algorithm?
Awarded Mar 14 at 16:37
Worst-case input for median-of-medians with groups of size 3
Awarded Mar 14 at 14:27
Applying a multi qubit quantum gate to specific qubits
Awarded Mar 14 at 9:57
What algorithms exist for solving natural number linear systems?
Awarded Mar 9 at 13:49
Why does merging two sorted arrays take 2N - 1 comparisons?
Awarded Mar 4 at 17:27
How to find a "short" walk that visits all vertices of a strongly connected directed graph
Awarded Feb 21 at 2:42
What is the intuition on why the longest path problem does not have optimal substructure?
Awarded Feb 19 at 14:26
Traveling Salesman Problem with Neural Network
Awarded Feb 18 at 14:18
What is wrong with this conditional proof of P=NP?
Awarded Feb 12 at 12:07
Exactly how many clocks does a Computer consists of and how do they synchronize with each other?
Awarded Feb 7 at 23:15
How to find a local minimum of a complete binary tree?
Awarded Jan 30 at 22:41
Type inference + overloading
Awarded Jan 29 at 21:36
pick K random integers without repetition
Awarded Jan 25 at 15:52
What are the real world applications of set cover problem?
Awarded Jan 24 at 17:25
What is practical difference between NP and PSPACE-complete?
Awarded Jan 23 at 20:56
Resources for studying the mathematical foundations of machine learning, for someone from a math/physics background
Awarded Jan 19 at 15:51
Mathematical benefit to use CPU/memory that increases by powers of 2 as 8-bit, 16-bit, 32-bit, 64-bit, etc?
Awarded Jan 19 at 15:51
Why is Integer Linear Programming in NP?
Awarded Jan 18 at 16:13
What is the difference between assignment, valuation and name binding?
Awarded Jan 17 at 4:47
Maximum subset pairwise not divisible by $K$
Awarded Jan 14 at 11:20
Why are computable numbers (in Turing's sense) enumerable?
Awarded Jan 7 at 10:40
Has there been any more progress on P vs. PSPACE compared to P vs. NP?
Awarded Jan 5 at 14:28
Why does introsort use heapsort rather than mergesort?
Awarded Jan 3 at 12:05
Is weighted XOR-SAT NP-hard?
Awarded Dec 17, 2023 at 21:30
Example of a false proposition when assuming Type : Type
Awarded Dec 16, 2023 at 14:22
Why is the halting problem semi-decidable?
Awarded Dec 13, 2023 at 23:47
1
2 3 4 5
…
32