Computer Science

Teacher

 Teacher
Answer a question with score of 1 or more.
Awarded 6071 times.
Does the use of True randomness work in this proof for P does not equal NP
Awarded 6 hours ago
Incomplete definition of function- first order logic
Awarded Nov 28 at 15:11
Turing machine for language $\{a^p | p~\text{is a prime number}\}$
Awarded Nov 27 at 4:17
Is loading from L2 or L3 of multi level cache direct or require a transfer to L1
Awarded Nov 25 at 8:41
A machine with multiple oracles
Awarded Nov 23 at 11:06
A $O(|E||V|)$ algorithm to determine if a graph is singly connected?
Awarded Nov 17 at 14:20
What does it mean to prove the halting problem is undecidable "using arithmetization"?
Awarded Nov 14 at 12:12
Since the halting problem is undecidable, does that mean that there exists an always undecidable program?
Awarded Nov 13 at 21:42
Is transitivity required for a sorting algorithm
Awarded Nov 11 at 11:10
Can you find a counter example for this sketch of a solution to the halting problem?
Awarded Nov 5 at 13:55
Algorithmic Complexity of Recognizing Claw-Free Graphs
Awarded Oct 31 at 23:55
Linked Lists, Ordered Pairs?
Awarded Oct 30 at 16:51
Check whether set of strings is prefix-free via lexicographic sort?
Awarded Oct 28 at 5:55
(post deleted or otherwise unavailable)
Awarded Oct 27 at 20:42
Why is 2's complement used for representing negative numbers?
Awarded Oct 26 at 5:20
How does the program counter "know" when the fetch cycle is complete?
Awarded Oct 26 at 2:18
1's and 2's complement of 0
Awarded Oct 24 at 7:52
Z Notation: sequence of sequences - find sum
Awarded Oct 23 at 17:37
Why use Welford's Method over a more naive approach?
Awarded Oct 19 at 15:05
Regular expression for the language accepting the strings containing at most one pair of $1$'s over $\{0,1\}$
Awarded Oct 19 at 6:49
If X is poly-time reducible to Y and X is in P, then Y is in P
Awarded Oct 19 at 1:22
Abstract Interpretation: prove that the sign subtraction is increasing in each of its parameters
Awarded Oct 13 at 4:32
Queries regarding simulation of multi-tape turing machine using single tape turing machine
Awarded Oct 12 at 16:52
Is the flexible bin packing problem NP-complete?
Awarded Oct 11 at 18:02
Booth bit-pair recoding technique
Awarded Oct 11 at 6:40
Hungarian method: seemingly different algorithms from different sources?
Awarded Oct 9 at 18:20
Is communication between processes really important for a OS or is it just a convenience?
Awarded Oct 7 at 1:55
CSES problem Two Sets II
Awarded Oct 6 at 21:47
Question about step in proof that predecessor subgraph forms a breadth-first tree
Awarded Oct 5 at 22:40
Valid Lambda Expressions
Awarded Oct 5 at 14:42
How to evaluate an arbitrary mathematical expression
Awarded Oct 2 at 13:50
How AlphaDev improved sorting algorithms?
Awarded Sep 30 at 10:27
How to maintain completely dynamic convex hull quickly?
Awarded Sep 28 at 13:17
RE Construction: Strings of even length in alphabet {a,b,c} that contain exactly one a
Awarded Sep 28 at 12:17
Constrained Delaunay triangulation algorithm?
Awarded Sep 26 at 19:31
Can the perceptron classifier achieve perfect accuracy, on any data set?
Awarded Sep 25 at 7:42
Question about Complete partially Directed Acyclic Graph
Awarded Sep 20 at 7:46
Why is the heap data structure called 'heap'?
Awarded Sep 20 at 4:42
Can you transform 3sat (or equivalent) into another satisfiability problem that increases the ratio of solutions to non-solutions
Awarded Sep 19 at 22:21
Convert a rational number to a floating-point number exactly
Awarded Sep 19 at 17:56
Curry-Howard isomorphism and non-constructive logic
Awarded Sep 18 at 10:05
Is there any computation formalism based on general relativity?
Awarded Sep 17 at 0:07
Time Complexity of Linear Search vs Brute Force
Awarded Sep 13 at 6:03
prove or give counterexample about regular language
Awarded Sep 12 at 13:47
Show that the language is undecidable
Awarded Sep 11 at 17:55
Is UTF-8 the final character encoding for all future time?
Awarded Sep 11 at 8:08
If P != NP, can every NP-complete language be partitioned into two NP-complete subsets?
Awarded Sep 8 at 1:26
Are 2 independent PDAs equivalent to a turing machine?
Awarded Aug 31 at 20:11
Splay trees: why are depths of nodes on the access path halved?
Awarded Aug 31 at 11:34
Clique and verteces degree
Awarded Aug 29 at 17:40
The complexity of checking for short cycles in a graph
Awarded Aug 28 at 17:21
Correct term for a priority queue with unique elements
Awarded Aug 25 at 18:26
Show that if <S1;S2,s> => * s', it is not necessarily the case that <S1,s> =>* s'
Awarded Aug 25 at 7:40
What are the conditions necessary for a programming language to have no undefined behavior?
Awarded Aug 21 at 5:51
What are the conditions necessary for a programming language to have no undefined behavior?
Awarded Aug 18 at 21:02
What can i say about L1 given that L2, L1L2 and L2L1 are regular?
Awarded Aug 17 at 12:27
$n \pmod k$ circuit
Awarded Aug 16 at 5:21
How are blind writes recoverable in a transaction schedule?
Awarded Aug 15 at 17:00
Finding MST after adding a new vertex
Awarded Aug 15 at 9:56
Sum of unique elements in all sub-arrays of an array
Awarded Aug 10 at 9:35
1
2 3 4 5
…
102

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.